Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"Fixed point iterations"”.
-
Fixed Point Iterations for Finite Sum Monotone Inclusions
… present a novel way of ensuring convergence of iterations of nonlinear resolvents by the means of a momentum term. This approach leads in many cases to cheaper per-iteration cost compared to a previously established projection approach. The framework covers many existing methods and we provide a …
-
Analysis of the Three-operator Davis-Yin Splitting in the Inconsistent Case
… optimization and inclusion problems as fixed-point iterations. Our study investigates its behavior when no fixed point exists. We prove, under mild assumptions, that the Davis–Yin shadow sequence converges to a solution of the normal problem, which represents a minimal perturbation of …
-
Inexact Fixed-Point Proximity Algorithms for Nonsmooth Convex Optimization
… dissertation is to develop efficient inexact fixed-point proximity algorithms with convergence guaranteed for nonsmooth convex optimization problems encountered in data science. Nonsmooth convex optimization is one of the core methodologies in data science to acquire knowledge from real-world …
-
Some Results on the Convergence of Anderson Acceleration
… technique used to accelerate the convergence of fixed-point iterations $\bm{x}_{k+1}=\bm{q}(\bm{x}_k)$, $k=0,1,\dots$, with $\bm{q}:\R^n\to\R^n$, $\bm{x}_k\in\R^n$. AA was first introduced by D.G. Anderson in the context of solving integral equations but has since been adapted to fixed-point …
-
A Finite Element-Multibody Dynamics Co-simulation Methodology Applied to FAST
… the equations of motion. The floating frame is fixed at the blade root. Such a formulation results in ordinary differential equations without added algebraic constraints. A variety of loose coupling and tight coupling schemes are examined for this problem. To synchronize the coupling variables, …
-
Acceleration Methods for Nonlinear Solvers and Application to Fluid Flow Simulations
… convergence rate and improves the robustness of fixed-point iterations schemes, and continuous data assimilation (CDA) which drives the approximate solution towards coarse data measurements or observables by adding a penalty term. We analyze the properties of nonlinear solvers to apply the AA …
-
ADMM-Type Methods for Optimization and Generalized Nash Equilibrium Problems in Hilbert Spaces
… the theory of Banach and Hilbert spaces, fixed-point iterations as well as convex and monotone set-valued analysis, is presented. Thereafter, certain optimization problems and generalized Nash equilibrium problems are reformulated and analyzed using variational inequalities and set-valued …
-
A High-Order Low-Order Algorithm with Exponentially-Convergent Monte Carlo for Thermal Radiative Transfer Problems
… (TRT) problems. Within each discrete time step, fixed-point iterations are performed between a high-order (HO) exponentially-convergent Monte Carlo (ECMC) solver and a low-order (LO) system of equations. The LO system is based on spatial and angular moments of the transport equation and a …
-
Unconstrained online convex optimization: regularization in the adversarial setting and beyond
… feedback carries information about learning a fixed objective, whereas general online convex optimization is adversarial. We formalize this as the stochastic-like condition, under which iterate stability follows: the iterates of any comparator-adaptive algorithm automatically remain near the …
-
First order optimisation algorithms in uncertain environments: iterate to minimise the uncertain gap between rationality and reality
… These algorithms are formulated as recursive fixed-point iterations characterised by stochastic nonexpansive operators that are parametrised by recursive estimates of uncertain parameters in the presence of noise. Since nonexpansiveness is preserved under convex combinations, we propose the …
-
Towards electronic structure calculations at the Exascale
… This method allows computation of the $\Gamma$-point and infinite-cell calculations without resorting to Brillouin zone integration or large supercells. The method is validated and systematic convergence of energy and forces to the exact diagonalization result is demonstrated. Convergence with …
-
Efficient time-stepping approaches for the dispersive shallow water equations
This dissertation focuses on developing efficient and stable (high order) time-stepping strategies for the dispersive shallow water equations (DSWE) with variable bathymetry. The DSWE extends the regular shallow water equations to include dispersive effects. Dispersion is physically important and …
-
Thruster Fault Diagnosis and Accommodation for Overactuated Open-Frame Underwater Vehicles
… integrates the pseudoinverse method and the fixed-point iterations method. A control energy cost function is used as the optimisation criteria. In fault-free and faulty cases the FAS finds the optimal solution, which minimises this criteria. The concept of feasible region is developed in …
-
Elastically Coupled Numerical Fluid Models for Flows Found in Composites Manufacturing
… coupling scheme based on quasi-steady fixed-point iterations. Simple test cases were used to validate the coupled models as well as the structural and fluid models operating in isolation. CPU profiling informed changes which led to a significant speeding up of both codes. Finally, the …
-
Robustly Complete Temporal Logic Control Synthesis for Nonlinear Systems
… to the soundness and robust completeness is a fixed-point characterization of the winning set of the system with respect to a given specification, which is the set of initial conditions that can be controlled to satisfy the specification. Regarding discrete-time systems, such characterizations …
-
Efficient and Flexible First-Order Optimization Algorithms
… these methods is reasonably low, the number of iterations needed for finding a solution—especially if medium or high accuracy is needed—can in practice be very high; as a result, the overall computational cost of using these methods would still be high. This thesis focuses on one of the most …
-
Preconditioning of Hybridizable Discontinuous Galerkin Discretizations of the Navier-Stokes Equations
… of 2x2 block preconditioned Krylov or fixed-point iterations to a given tolerance, with convergence of the underlying preconditioned Schur-complement problem. In particular, results indicate that an effective Schur-complement preconditioner is a necessary and sufficient condition for …
-
Nonlinear Preconditioning Methods for Optimization and Parallel-In-Time Methods for 1D Scalar Hyperbolic Partial Differential Equations
… have alternating least squares (ALS) type fixed point iterations derived from their optimization problem definitions. While these ALS type iterations may be slow to converge in practice, they can serve as efficient nonlinear preconditioners for the other optimization methods. As the Tucker …