scientific article; zbMATH DE number 3511513
zbMATH Open0326.65033MaRDI QIDQ4091368FDOQ4091368
Authors: Roger Fletcher
Publication date: 1976
Title of this publication is not available (Why is that?)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) General theory of numerical analysis in abstract spaces (65J05) Numerical computation of solutions to systems of equations (65H10) Numerical methods for integral equations (65R20) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15)
Cited In (only showing first 100 items - show all)
- A Comparison of Three Basic Conjugate Direction Methods
- On the use of conjugate gradient-type methods for boundary integral equations
- Extended rank reduction formulas containing Wedderburn and Abaffy-Broyden-Spedicato rank reducing processes
- The parallel iterative methods (PIM) package for the solution of systems of linear equations on parallel computers
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- Multilevel methods to solve the neutron diffusion equation
- An iterative solution scheme for systems of boundary element equations
- Numerical linear algebra for reconstruction inverse problems.
- Breakdowns in the implementation of the Lánczos method for solving linear systems
- Tensor product-type methods for solving Sylvester tensor equations
- Implementation of an adaptive algorithm for Richardson's method
- Conjugate gradient method for finding fundamental solitary waves
- Iterative solvers for BEM algebraic systems of equations
- Complex conjugate gradient methods
- An element-by-element BICGSTAB iterative method for three-dimensional steady Navier-Stokes equations
- New implementations of Lanczos method
- A limited survey of various conjugate gradient methods for solving complex matrix equations arising in electromagnetic wave interactions
- A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
- Fast solvers for optimal control problems from pattern formation
- Minimal residual smoothing in multi-level iterative method
- Preconditioned CG-type methods for solving the coupled system of fundamental semiconductor equations
- Newton-Krylov methods applied to a system of convection-diffusion-reaction equations
- On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
- Analysis and practical use of flexible biCGStab
- Remark on the relationship between the biconjugate direction algorithm and the generalized conjugate direction algorithm
- An overview of approaches for the stable computation of hybrid BiCG methods
- Residual smoothing and peak/plateau behavior in Krylov subspace methods
- Flexible and deflated variants of the block shifted GMRES method
- Between Newton and Cauchy: the diagonal variable metric method; theory and test results
- Rapid parallel evaluation of integrals in potential theory on general three-dimensional regions
- Flow topology in a steady three-dimensional lid-driven cavity
- Variations of Zhang's Lanczos-type product method
- Preconditioned Krylov solvers for BEA
- Nonuniform torsion analysis in tapered composite bars by including higher-order warping modes
- Efficient iterative solution of constrained finite element analyses
- Preconditioners for Krylov subspace methods: An overview
- A new Lanczos-type algorithm for systems of linear equations
- A new taxonomy of conjugate gradient methods
- Sparse two-sided rank-one updates for nonlinear equations
- A review of formal orthogonality in Lanczos-based methods
- Projection-minimization methods for nonsymmetric linear systems
- Numerical analysis of flow-induced gas entrainment in roll coating
- An iterative method for large sparse linear systems on a vector computer
- Constructing efficient substructure-based preconditioners for BEM systems of equations
- An iterative solution method for solving sparse nonsymmetric linear systems
- A finite-element, parameter stepping solution procedure for the steady- state Boussinesq equations
- A linear system solver based on a modified Krylov subspace method for breakdown recovery
- Tridiagonal preconditioning for Poisson-like difference equations with flat grids: Application to incompressible atmospheric flow
- Lanczos-type algorithms for solving systems of linear equations
- Projection methods for linear systems
- On the performance of certain direct and iterative methods on equations arising on a two-dimensional in situ combustion simulator
- Scattering of antiplane impact waves by cracks in a layered elastic solid
- The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
- A note on convergence of quasi-minimal residual smoothing
- Shanks sequence transformations and Anderson acceleration
- Implementation of an implicit pressure-velocity coupling for the Eulerian multi-fluid model
- A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
- On a class of preconditioners for solving the Helmholtz equation
- Preconditioning techniques for large linear systems: A survey
- IDR(\(s\)) for solving shifted nonsymmetric linear systems
- A new preconditioner for the interface system arising in a fast Helmholtz solver
- Accelerating with rank-one updates
- Numerical linear algebra algorithms and software
- Solution of BEM systems of equations via iterative techniques
- A quasi-minimal residual variant of IDRstab using the residual smoothing technique
- Motion of a particle between two parallel plane walls in low-Reynolds-number Poiseuille flow
- A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems
- A new approach to sub-grid surface tension for LES of two-phase flows
- An implicit Vlasov-Fokker-Planck code to model non-local electron transport in 2-D with magnetic fields.
- BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
- Performance of hyperplane ordering on vector computers
- On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
- A generalized product-type BiCOR method and its application in signal deconvolution
- A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
- A variant of the IDR\((s)\) method with the quasi-minimal residual strategy
- GBi-CGSTAB(\(s,L\)): IDR(\(s\)) with higher-order stabilization polynomials
- Iterative solvers for image denoising with diffusion models: a comparative study
- Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\)
- A comparative study of iterative solutions to linear systems arising in quantum mechanics
- Maintaining convergence properties of BiCGStab methods in finite precision arithmetic
- Iterative solution of linear systems in the 20th century
- Title not available (Why is that?)
- Conjugate gradient and minimal residual method for solving symmetric indefinite systems
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
- Fast parameterized inexact Uzawa method for complex symmetric linear systems
- Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
- BiCGStab, VPAStab and an adaptation to mildly nonlinear systems
- Conjugate decomposition and its applications
- A COCR method for solving complex symmetric linear systems
- Block ILU factorization preconditioners for a block-tridiagonal \(H\)-matrix
- An extension of the conjugate residual method to nonsymmetric linear systems
- BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices
- A fast implementation for GMRES method
- Matrix-free interior point method
- Multiple bifurcations in a reaction-diffusion problem
- A polynomial preconditioner for the GMRES algorithm
- On a variable smoothing procedure for Krylov subspace methods
- Generalized global conjugate gradient squared algorithm
- Conjugate gradient-type algorithms for a finite-element discretization of the Stokes equations
- A generalization of \(s\)-step variants of gradient methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091368)