Results 31 to 40 of about 8,399 (255)
Fast iterative solvers for PDE-constrained optimization problems
In this thesis, we develop preconditioned iterative methods for the solution of matrix systems arising from PDE-constrained optimization problems. In order to do this, we exploit saddle point theory, as this is the form of the matrix systems we wish to ...
Pearson, John W
core +1 more source
A New Perspective on the Convergence of Mean-Based Methods for Nonlinear Equations
Many problems in science, engineering, and economics require solving of nonlinear equations, often arising from attempts to model natural systems and predict their behavior.
Alicia Cordero +2 more
doaj +1 more source
An optimal variational iteration method
AbstractThe variational iteration method is studied in the present work. The classical variational iteration method is improved and extended by introducing a new concept of a convergence accelerating parameter. A rigorous approach is later proposed for optimally determining the value of the convergence accelerating parameter.
openaire +1 more source
Preconditioning Iterative Methods for the Optimal Control of the Stokes Equations [PDF]
Solving problems regarding the optimal control of partial differential equations (PDEs)—also known as PDE-constrained optimization—is a frontier area of numerical analysis. Of particular interest is the problem of flow control, where one would like to effect some desired flow by exerting, for example, an external force.
Tyrone Rees, Andrew J. Wathen
openaire +3 more sources
On the Iterative Solution Methods for Finite-Dimensional Inclusions with Applications to Optimal Control Problems [PDF]
Iterative methods for finite-dimensional inclusions which arise in applying a finite-element or a finite-difference method to approximate state-constrained optimal control problems have been investigated.
Lapin, S, Lapin, A, Laitinen, E
core +1 more source
Communication-optimal iterative methods
Data movement, both within the memory system of a single processor node and between multiple nodes in a system, limits the performance of many Krylov subspace methods that solve sparse linear systems and eigenvalue problems. Here, s iterations of algorithms such as CG, GMRES, Lanczos, and Arnoldi perform s sparse matrix-vector multiplications and ?(s ...
J Demmel +3 more
openaire +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
On Iterative Methods in Optimization
Abstract: The paper highlights a failure in the implementation of a recommendation for the modified Newton’s method using a Rosenbrock type of functions that have slow convergence with two minimum points as test functions. The study finds that a recommended procedure, if the Hessian at a point is not positive definite, may not lead to the desired ...
null Henrietta Nkansah +1 more
openaire +1 more source
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
Notes on the optimal variational iteration method
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

