Headlamp innovations: optical concepts for fully adaptive light distributions

2018 ◽  
Author(s):  
Marvin Knöchelmann ◽  
Gerolf Kloppenburg ◽  
Roland Lachmayer
Keyword(s):  
Fully Adaptive

scholarly journals Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver

2021 ◽  
Author(s):  
Alexander Haberl ◽  
Dirk Praetorius ◽  
Stefan Schimanko ◽  
Martin Vohralík
Keyword(s):  
Adaptive Algorithm ◽  
Adaptive Mesh Refinement ◽  
Elliptic Boundary ◽  
Mesh Refinement ◽  
Adaptive Mesh ◽  
Picard Iteration ◽  
Optimal Rate ◽  
Stopping Criteria ◽  
Element Discretization ◽  
Fully Adaptive

AbstractWe consider a second-order elliptic boundary value problem with strongly monotone and Lipschitz-continuous nonlinearity. We design and study its adaptive numerical approximation interconnecting a finite element discretization, the Banach–Picard linearization, and a contractive linear algebraic solver. In particular, we identify stopping criteria for the algebraic solver that on the one hand do not request an overly tight tolerance but on the other hand are sufficient for the inexact (perturbed) Banach–Picard linearization to remain contractive. Similarly, we identify suitable stopping criteria for the Banach–Picard iteration that leave an amount of linearization error that is not harmful for the residual a posteriori error estimate to steer reliably the adaptive mesh-refinement. For the resulting algorithm, we prove a contraction of the (doubly) inexact iterates after some amount of steps of mesh-refinement/linearization/algebraic solver, leading to its linear convergence. Moreover, for usual mesh-refinement rules, we also prove that the overall error decays at the optimal rate with respect to the number of elements (degrees of freedom) added with respect to the initial mesh. Finally, we prove that our fully adaptive algorithm drives the overall error down with the same optimal rate also with respect to the overall algorithmic cost expressed as the cumulated sum of the number of mesh elements over all mesh-refinement, linearization, and algebraic solver steps. Numerical experiments support these theoretical findings and illustrate the optimal overall algorithmic cost of the fully adaptive algorithm on several test cases.

A new approach for testing autonomous and fully adaptive radars

2017 ◽  
Author(s):  
Jameson Bergin ◽  
David Kirk ◽  
Joel Studer ◽  
Joseph Guerci ◽  
Murali Rangaswamy
Keyword(s):  
New Approach ◽  
Fully Adaptive

A fully adaptive 19-to-56Gb/s PAM-4 wireline transceiver with a configurable ADC in 16nm FinFET

2018 ◽  
Author(s):  
Parag Upadhyaya ◽  
Chi Fung Poon ◽  
Siok Wei Lim ◽  
Junho Cho ◽  
Arianne Roldan ◽  
...  
Keyword(s):  
Fully Adaptive

A fully adaptive front tracking method for the simulation of two phase flows

2014 ◽  
Vol 58 ◽  
pp. 72-82 ◽  
Author(s):  
M.R. Pivello ◽  
M.M. Villar ◽  
R. Serfaty ◽  
A.M. Roma ◽  
A. Silveira-Neto
Keyword(s):  
Front Tracking ◽  
Two Phase Flows ◽  
Two Phase ◽  
Tracking Method ◽  
Front Tracking Method ◽  
Fully Adaptive

Wideband flexible-reach techniques for a 0.5–16.3Gb/s fully-adaptive transceiver in 20nm CMOS

2014 ◽  
Author(s):  
Jafar Savoj ◽  
Hesam Aslanzadeh ◽  
Declan Carey ◽  
Marc Erett ◽  
Wayne Fang ◽  
...  
Keyword(s):  
Fully Adaptive
Sign in / Sign up

Export Citation Format

Share Document