Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
From MaRDI portal
Publication:1249421
DOI10.1007/BF02252030zbMath0385.65048MaRDI QIDQ1249421
Gene H. Golub, Dianne P. O'Leary, Paul Concus
Publication date: 1978
Published in: Computing (Search for Journal in Brave)
53A10: Minimal surfaces in differential geometry, surfaces with prescribed mean curvature
35J60: Nonlinear elliptic equations
65N12: Stability and convergence of numerical methods for boundary value problems involving PDEs
65M12: Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs
65F10: Iterative numerical methods for linear systems
65N22: Numerical solution of discretized equations for boundary value problems involving PDEs
Related Items
On the preconditioning of the bidiagonalization technique, Block two-stage preconditioners, Recursive interpolation algorithm: A formalism for solving systems of linear equations. II: Iterative methods, Block splittings for the conjugate gradient method, Experiments in numerical methods for a problem in combustion modeling, On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems, Use of fast direct methods for mildly nonlinear elliptic difference equations, The use of second degree normalized implicit conjugate gradient methods for solving large sparse systems of linear equations, A symmetric iterative interval method for systems of nonlinear equations, On some versions of incomplete block-matrix factorization iterative methods, A new preconditioning technique for solving large sparse linear systems, A parallel alternating direction implicit preconditioning method, An analysis of some element-by-element techniques, Preconditioned iterative methods for convection diffusion and related boundary value problems, Numerical solution of the Hele-Shaw equations, Contraction numbers for additive correction methods, Personal report : Gene Howard Golub, 1932--2007, Nonlinear successive over-relaxation, A unified derivation for fast estimation algorithms by the conjugate direction method, A computational process for choosing the relaxation parameter in nonlinear SOR, An iterative solution method for solving sparse nonsymmetric linear systems, A block preconditioned conjugate gradient-type iterative solver for linear systems in thermal reservoir simulation, A 3-D Poisson solver based on conjugate gradients compared to standard iterative methods and its performance on vector computers, Capacitance matrix method using strips with alternating Neumann and Dirichlet boundary conditions, Interval arithmetic methods for systems of nonlinear equations arising from discretizations of quasilinear elliptic and parabolic partial differential equations, Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms, A survey of the advances in the exploitation of the sparsity in the solution of large problems, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, Numerical solution of a subsidence mound problem in a porous medium, Maximal chordal subgraphs, s-step iterative methods for symmetric linear systems, On the norm equivalence of singularly perturbed elliptic difference operators, On the numerical solution of nonlinear problems in fluid dynamics by least squares and finite element methods. I. Least square formulations and conjugate gradient solution of the continuous problems, The block conjugate gradient algorithm and related methods, An automatic scaling procedure for a D'yakonov-Gunn iteration scheme, On the efficient solution of nonlinear finite element equations. I, Finite-element methods for the calculation of capillary surfaces, Roundoff-error analysis of a new class of conjugate-gradient algorithms, Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations, Quadratic programming with M-matrices, On the efficient solution of nonlinear finite element equations. II. Bound-constrained problems, Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods, Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems, On global convergence of coordinate relaxation in the case of an unsymmetrical, diagonally dominant Jacobian, A domain decomposition preconditioner with reduced rank interdomain coupling, Domain decomposition preconditioning for \(p\)-version finite elements with high aspect ratios, Lanczos and Arnoldi methods for the solution of convection-diffusion equations, On element-by-element preconditioning for general elliptic problems, The Lanczos optimization of a splitting-up method to solve homogeneous evolutionary equations, On incomplete block factorization methods of generalized SSOR type for \(H\)-matrices, The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations, On the fast solutions of nonlinear elliptic equations, Bibliography on the evaluation of numerical software, Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations, A hybrid iterative method for symmetric indefinite linear systems, Solution of biharmonic equations with application to radar imaging, Domain decomposition and parallel processing of a finite element model of the shallow water equations, The superlinear convergence behaviour of GMRES, Iterative solution of linear systems in the 20th century, A note on the restarted CG method and reduced space additive correction, Comparison of Lanczos and CGS solvers for solving numerical heat transfer problems, Further results on the convergence behavior of conjugate-gradients and Ritz values, Incomplete blockwise factorizations of (block) H-matrices, Truncated interval arithmetic block cyclic reduction, Minimal eigenvalue of large sparse matrices by an efficient reverse power-conjugate gradient scheme, A conjugate gradient algorithm applied to plane stress-strain problems, A method of solving nonlinear variational problems by nonlinear transformation of the objective functional. I, Efficient and reliable iterative methods for linear systems, Convergence and instability in PCG methods for bordered systems, The construction of an algebraically reduced system for the acceleration of preconditioned conjugate gradients, Determination of a good value of the time step and preconditioned Krylov subspace methods for the Navier-Stokes equations, On the theory of equivalent operators and application to the numerical solution of uniformly elliptic partial differential equations, Interval arithmetic multistep methods for nonlinear systems of equations, An Incomplete Factorization Technique for Positive Definite Linear Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A conjugate direction algorithm without line searches
- Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches
- Partial conjugate gradient methods for a class of optimal control problems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Restart procedures for the conjugate gradient method
- On Fourier-Toeplitz Methods for Separable Elliptic Problems
- Function minimization by conjugate gradients
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- Relaxation Methods for Convex Problems
- Numerical Solution of the Minimal Surface Equation
- On Direct Methods for Solving Poisson’s Equations
- Methods of conjugate gradients for solving linear systems