scientific article; zbMATH DE number 3976197
zbMATH Open0604.65011MaRDI QIDQ3740904FDOQ3740904
A. M. Erisman, J. K. Reid, Iain S. Duff
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
algorithmspivotingsparse matricesorderingdirect methodstextbookproblemstest matricesFORTRANPartitioningstoringtearing methods
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cited In (only showing first 100 items - show all)
- Diagonal scaling of ill-conditioned matrixes by genetic algorithm
- Algebraic languages for mathematical programming
- Preconditioning techniques for large linear systems: A survey
- On sparse matrix orderings in interior point methods
- Additive preconditioning and aggregation in matrix computations
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III
- An SQP method for general nonlinear programs using only equality constrained subproblems
- On the ordering of sparse linear systems
- Road vehicle modeling requirements for optimization of ride and handling
- Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos
- Efficient sensitivity analysis of large-scale differential-algebraic systems
- Two improved algorithms for envelope and wavefront reduction
- Title not available (Why is that?)
- Parallel algorithms for solving large linear systems
- Stability of the Gauss-Huard algorithm with partial pivoting
- Ordering algorithms for irreducible sparse linear systems
- Finite-element method for elastic wave propagation
- Efficient robust optimization for robust control with constraints
- A sparse matrix approach to Bayesian computation in large linear models
- Direct Methods for Sparse Linear Systems
- Numerical study on incomplete orthogonal factorization preconditioners
- Parallel preconditioned conjugate gradient algorithm on GPU
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Modified incomplete orthogonal factorization methods using Givens rotations
- A new matrix bandwidth reduction algorithm
- Localization in Matrix Computations: Theory and Applications
- The effect of ordering on preconditioned conjugate gradients
- An implementation of Karmarkar's algorithm for linear programming
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- The column-updating method for solving nonlinear equations in Hilbert space
- Control of large-scale systems in a multiprocessor environment
- A block algorithm for computing rank-revealing QR factorizations
- Matrix-free interior point method
- Algebraic stabilization of explicit numerical integration for extremely stiff reaction networks
- A geometric framework for sparse matrix problems
- An extension of the theory of secant preconditioners
- A two-level ILU preconditioner for electromagnetic applications
- LPAKO: A Simplex-based Linear Programming Program
- Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
- An efficient direct method for fully conforming spectral collocation schemes
- Title not available (Why is that?)
- Alternating direction algorithms for solving Hamilton-Jacobi-Bellman equations
- ILUT: A dual threshold incomplete LU factorization
- Solving piecewise linear systems in ABS-normal form
- Matrix sparsification and the sparse null space problem
- Efficient implementation of stable Richardson extrapolation algorithms
- Optimization of a complex flexible multibody systems with composite materials
- High performance inverse preconditioning
- New crash procedures for large systems of linear constraints
- On efficient preconditioners for iterative solution of a Galerkin boundary element equation for the three-dimensional exterior Helmholtz problem
- DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations
- RGIsearch: a C++ program for the determination of renormalization group invariants
- Sparsity in higher order methods for unconstrained optimization
- Stability and inertia
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- Analysis and implementation of a dual algorithm for constrained optimization
- A spectral algorithm for envelope reduction of sparse matrices
- Effective preconditioning through minimum degree ordering interleaved with incomplete factorization
- ARANEA, a program for generating unstructured triangular meshes with a JAVA graphics user interface
- Sparsity in convex quadratic programming with interior point methods
- A hierarchical algorithm for making sparse matrices sparser
- Coreduction homology algorithm
- Randomized preprocessing of homogeneous linear systems of equations
- How ordinary elimination became Gaussian elimination
- Twisted factorization of a banded matrix
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Sparse direct factorizations through unassembled hyper-matrices
- A frontal solver tuned for fully coupled non-linear hygro-thermo-mechanical problems
- A nine-point finite volume scheme for the simulation of diffusion in heterogeneous media
- MOPS -- Mathematical optimization system
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- A parallel projection method for overdetermined nonlinear systems of equations
- A robust ILU with pivoting based on monitoring the growth of the inverse factors
- A static-regridding method for two-dimensional parabolic partial differential equations
- Recent computational developments in Krylov subspace methods for linear systems
- Parallel solution of large-scale free surface viscoelastic flows via sparse approximate inverse preconditioning
- Multi-domain dual reciprocity BEM approach for the Navier-Stokes system of equations
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Partitioning mathematical programs for parallel solution
- Inverse-free recursive multiresolution algorithms for a data approximation problem
- A Guideline for Using the Multi-Domain BEM for Analyzing the Interior Acoustic Field
- LU factorization of non-standard forms and direct multiresolution solvers
- Preconditioning complex symmetric linear systems
- Computational experience with a primal-dual interior point method for linear programming
- A manifold-based approach to sparse global constraint satisfaction problems
- A variation on the interior point method for linear programming using the continued iteration
- Qualitative decomposition of the eigenvalue problem in a dynamic system
- Experiences with sparse matrix solvers in parallel ODE software
- A survey of direct methods for sparse linear systems
- Symbolic manipulation techniques for model simplification in object-oriented modelling of large scale continuous systems
- A clustering method based on multidimensional texture analysis
- Globally Convergent Algorithm for Solving Large Nonlinear Systems of Equations
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
- A fast LU update for linear programming
- Title not available (Why is that?)
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- A new approach to compute sparse approximate inverse factors of a matrix
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 Q3740904)