scientific article; zbMATH DE number 3976197
From MaRDI portal
Publication:3740904
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)
- 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
- Symbiosis between linear algebra and optimization
- Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices
- Preconditioned conjugate gradient methods for three‐dimensional linear elasticity
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Analysis of the solution phase of a parallel multifrontal approach
- Computing the smallest singular triplets of a large matrix
- An efficient preconditioned iterative solver for solving a coupled fluid structure interaction problem
- Interior point methods for power flow optimization with security constraints
- On the row merge tree for sparse LU factorization with partial pivoting
- Event and apparent horizon finders for \(3+1\) numerical relativity
- The preconditioned conjugate gradient method with incomplete factorization preconditioners
- Loss and retention of accuracy in affine scaling methods
- A Class of Iterative Solvers for the Helmholtz Equation: Factorizations, Sweeping Preconditioners, Source Transfer, Single Layer Potentials, Polarized Traces, and Optimized Schwarz Methods
- An approximate inverse matrix technique for arrowhead matrices
- Vector processing in simplex and interior methods for linear programming
- A comparison of projective and direct solvers for finite elements in elastostatics
- Title not available (Why is that?)
- Efficient iterative solution of the three-dimensional Helmholtz equation
- Sparse direct methods for model simulation
- On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization
- Selection of fictitious independent variables for the solution of sparse linear equations
- Implementing linear algebra algorithms on a Meiko Computing Surface
- Numerical performance of projection methods in finite element consolidation models
- Influence of modeling structure in probabilistic sequential decision problems
- An efficient method for computing the inverse of arrowhead matrices
- A numerical scheme for the solution of the space charge problem on a multiply connected region
- Linear algebraic transformations of the bidomain equations: Implications for numerical methods
- Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics
- Hybrid algorithms with automatic switching for solving nonlinear equation systems
- On the tree-depth of random graphs
- An isochoric domain deformation method for computing steady free surface flows with conserved volumes
- Implementation of sparse matrix algorithms in an advection-diffusion-chemistry module
- Title not available (Why is that?)
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- Direct, partitioned and projected solution to finite element consolidation models
- Advances in design and implementation of optimization software
- Multiprocessing a sparse matrix code on the Alliant FX/8
- A finite-difference scheme overconvergent at certain mesh points
- An iterative substructuring method for coupled fluid-solid acoustic problems
- High‐order hierarchical A‐ and L‐stable integration methods
- A nearly optimal preconditioner for the Navier–Stokes equations
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
- Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
- Explicit approximate inverse preconditioning techniques
- A unified formulation for mechanical joints with and without clearances/bushings and/or stops in the framework of multibody systems
- Composite materials in flexible multibody systems
- Explicit isomorphic iterative methods for solving arrow-type linear systems
- Wavelets in hybrid-mixed stress elements
- A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations
- A comparison of stiff ODE solvers for astrochemical kinetics problems
- Reversing the row order for the row-by-row frontal method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallelization of Advection-Diffusion-Chemistry Modules
- Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
- Newton's method for solving heat transfer, fluid flow and interface shapes in a floating molten zone
- An object‐oriented interface for the dynamic memory management of sparse discrete mathematical operators in numerical scientific applications
- Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
- Incomplete factorization by local exact factorization (ILUE)
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- Detecting embedded pure network structures in LP problems
- A Dimensional Reduction Algorithm and Software for Acyclically Dependent Constraints
- An organization of sparse gauss elimination for solving partial differntial equations on distributed memory machines
- Solving linear systems in interior-point methods
- Unravelling small world networks
- Cost-effective sulphur emission reduction under uncertainty
- Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems.
- Graph transformations for efficient structural analysis
- Making Bipartite Graphs DM-Irreducible
- A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems
- A highly flexible tool for large scale computational problems in applied physics
- Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement
- Symbolic elimination in dynamic optimization based on block-triangular ordering
- Title not available (Why is that?)
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Parallel homotopy algorithm for symmetric large sparse eigenproblems
- A general iterative sparse linear solver and its parallelization for interval Newton methods
- Development and validation of a chemical reaction solver coupled to the FLASH code for combustion applications
- Frequent directions: simple and deterministic matrix sketching
- On a network method for unsteady incompressible fluid flow on triangular grids
- An efficient algorithm for the solution of second order PDE’s using Taylor expansion polynomials
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- A frictional contact algorithm for implicit material point method
- A parallel implementation of Wang's method for solving tridiagonal systems
- A parallel row‐oriented sparse solution method for finite element structural analysis
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)
