An automatic scaling procedure for a D'yakonov-Gunn iteration scheme

DOI10.1016/0024-3795(79)90114-9zbMath0426.65056OpenAlexW2037651619MaRDI QIDQ1136207

Randolph E. Bank

Publication date: 1979

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(79)90114-9

zbMATH Keywords

preconditioned conjugate gradient iterationnonseparable elliptic equationsscaling procedureD'yakonov-Gunn iteration scheme

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (7)

On the theory of equivalent operators and application to the numerical solution of uniformly elliptic partial differential equations ⋮ On error formulas for approximation by sums of univariate functions ⋮ Milestones in the development of iterative solution methods ⋮ A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds ⋮ Characterizations of optimal scalings of matrices ⋮ Approximation by a sum of two algebras. The lightning bolt principle ⋮ A survey of preconditioned iterative methods for linear systems of algebraic equations

Uses Software

• Algorithm 527

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of preconditioned iterative methods for linear systems of algebraic equations
• On the approximation of a bivariate function by the sum of univariate functions
• A note on the approximation of functions of several variables by sums of functions of one variable
• Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
• On the approximation of a function of several variables by the sum of functions of fewer variables
• Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]
• On the algorithm of diliberto and straus for approximating bivariate functions by univariate ones
• A direct Method for the Discrete Solution of Separable Elliptic Equations
• An $O(n^2 )$ Method for Solving Constant Coefficient Boundary Value Problems in Two Dimensions
• Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
• Marching Algorithms for Elliptic Boundary Value Problems. II: The Variable Coefficient Case
• The Solution of Elliptic Difference Equations by Semi-Explicit Iterative Techniques
• An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
• On Direct Methods for Solving Poisson’s Equations
• Applications of Linear Programming to Numerical Analysis
• Use of Fast Direct Methods for the Efficient Numerical Solution of Nonseparable Elliptic Equations
• A Generalized Cyclic Reduction Algorithm
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: An automatic scaling procedure for a D'yakonov-Gunn iteration scheme