Iterative accelerating algorithms with Krylov subspaces for the solution to large-scale nonlinear problems
Numerical methods for solving nonlinear equations typically require the solution of a sequence of linear systems (1) \(A^k x^k = b^k\), \(k = 1,2,\ldots\). In continuation of earlier work [see e.g. ibid. 17, No. 3-4 (1998; Zbl 0908.65034)], the authors consider the case when the \(A^k\) in (1) are different large, sparse, symmetric, positive definite matrices, and each system (1) is solved iteratively by a conjugate gradient method. Several new solvers are introduced that rely on a reuse of the Krylov subspaces associated with (1) for earlier indices. The principal idea is to split the search for the required minimum into two subspaces that are \(A^k\)-conjugate where the first subspace enables some filtering of information from the previous Krylov subspaces related to the large eigenvalues of the current \(A^k\). For the numerical assessment of the approach a class of problems is considered concerning large deformations of heterogeneous hyperelastic bodies. Certain computational aspects of memory management and complexity, as well as the use of parallel computer systems, are also addressed.
- An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
- A note on the efficiency of the conjugate gradient method for a class of time-dependent problems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Parallel solution of symmetric positive definite systems based on decomposition into overlapping blocks
- Least squares methods in Krylov subspaces
- scientific article; zbMATH DE number 1235187
- scientific article; zbMATH DE number 1748480
- scientific article; zbMATH DE number 1404619
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Non-overlapping domain decomposition methods in structural mechanics
- Nonlinear localization strategies for domain decomposition methods: application to post-buckling analyses
- Krylov iterative methods and synthetic acceleration for transport in binary statistical media
- A Rayleigh-Ritz preconditioner for the iterative solution to large scale nonlinear problems
- Experiments with Krylov subspace methods on a massively parallel computer
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- A double optimal iterative algorithm in an affine Krylov subspace for solving nonlinear algebraic equations
- Iterative across-time solution of linear differential equations: Krylov subspace versus waveform relaxation
- An automatic Krylov subspaces recycling technique for the construction of a global solution basis of non-affine parametric linear systems
- Iterative processes in the Krylov-Sonneveld subspaces
- Linear multifrequency-grey acceleration recast for preconditioned Krylov iterations
- An accelerated subspaces recycling strategy for the deflation of parametric linear systems based on model order reduction
- Krylov-subspace recycling via the POD-augmented conjugate-gradient method
- Local/global model order reduction strategy for the simulation of quasi-brittle fracture
- Total and selective reuse of Krylov subspaces for the resolution of sequences of nonlinear structural problems
- Substructured formulations of nonlinear structure problems -- influence of the interface condition
- scientific article; zbMATH DE number 5927297 (Why is no real title available?)
- From linear to nonlinear large scale systems
- A solver combining reduced basis and convergence acceleration with applications to non-linear elasticity
- A numerical case study on nonlinear methods induced by linear Krylov solvers
- Iterative solvers within sequences of large linear systems in non-linear structural mechanics
- On the linear convergence of Newton–Krylov methods
- scientific article; zbMATH DE number 1222716 (Why is no real title available?)
- scientific article; zbMATH DE number 1235187 (Why is no real title available?)
- On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces
- NITSOL: A Newton Iterative Solver for Nonlinear Systems
- A substructure-based iterative inner solver coupled with Uzawa's algorithm for the Stokes problem
- Multi space reduced basis preconditioners for large-scale parametrized PDEs
- Extended preconditioners for the FETI method applied to constrained problems
- Iterative Krylov Methods for Large Linear Systems
- Acceleration of iterative solution of series of systems due to better initial guess
- scientific article; zbMATH DE number 7604956 (Why is no real title available?)
- Recent developments in spectral stochastic methods for the numerical solution of stochastic partial differential equations
- An efficient implementation of the Gauss-Newton method via generalized Krylov subspaces
- A survey of subspace recycling iterative methods
- Bridging proper orthogonal decomposition methods and augmented Newton-Krylov algorithms: an adaptive model order reduction for highly nonlinear mechanical problems
- Domain decomposition techniques for the efficient modeling of brittle heterogeneous materials
- Model order reduction with Galerkin projection applied to nonlinear optimization with infeasible primal-dual interior point method
- Strict lower bounds with separation of sources of error in non-overlapping domain decomposition methods
- A priori hyperreduction method: an adaptive approach
This page was built for publication: Iterative accelerating algorithms with Krylov subspaces for the solution to large-scale nonlinear problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978035)
