scientific article
From MaRDI portal
Publication:3740904
zbMath0604.65011MaRDI QIDQ3740904
A. M. Erisman, John K. Reid, Iain S. Duff
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsorderingtextbooksparse matricesdirect methodsproblemspivotingPartitioningtest matricesFORTRANstoringtearing methods
Computational methods for sparse matrices (65F50) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items
Numerical aspects in developing LP softwares, LPAKO and LPABO, Parallel algorithms for solving large linear systems, A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, Backward error analysis of the shift-and-invert Arnoldi algorithm, High performance inverse preconditioning, Explicit preconditioned iterative methods for solving large unsymmetric finite element systems, A two-level ILU preconditioner for electromagnetic applications, A unified formulation for mechanical joints with and without clearances/bushings and/or stops in the framework of multibody systems, Hybrid algorithms with automatic switching for solving nonlinear equation systems, Development and validation of a chemical reaction solver coupled to the FLASH code for combustion applications, Matrix sparsification and the sparse null space problem, Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices, A highly flexible tool for large scale computational problems in applied physics, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, The preconditioned conjugate gradient method with incomplete factorization preconditioners, Stability of the Gauss-Huard algorithm with partial pivoting, RGIsearch: a C++ program for the determination of renormalization group invariants, Efficient sensitivity analysis of large-scale differential-algebraic systems, Preconditioning techniques for nonsymmetric and indefinite linear systems, Solving sparse linear least-squares problems on some supercomputers by using large dense blocks, Two improved algorithms for envelope and wavefront reduction, Preconditioning complex symmetric linear systems, On the row merge tree for sparse LU factorization with partial pivoting, Partitioning mathematical programs for parallel solution, Parallel solution of large-scale free surface viscoelastic flows via sparse approximate inverse preconditioning, Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse, Event and apparent horizon finders for \(3+1\) numerical relativity, Sparse direct methods for model simulation, On sparse matrix orderings in interior point methods, Explicit approximate inverse preconditioning techniques, On efficient preconditioners for iterative solution of a Galerkin boundary element equation for the three-dimensional exterior Helmholtz problem, Efficient implementation of stable Richardson extrapolation algorithms, Unravelling small world networks, Matrix-free interior point method, Parallel preconditioned conjugate gradient algorithm on GPU, Predispatch of hydroelectric power systems with modifications in network topologies, Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems., Implementation of sparse matrix algorithms in an advection-diffusion-chemistry module, Algebraic stabilization of explicit numerical integration for extremely stiff reaction networks, Efficient robust optimization for robust control with constraints, Selection of fictitious independent variables for the solution of sparse linear equations, On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization, Effective preconditioning through minimum degree ordering interleaved with incomplete factorization, Implementing linear algebra algorithms on a Meiko Computing Surface, A static-regridding method for two-dimensional parabolic partial differential equations, A numerical scheme for the solution of the space charge problem on a multiply connected region, A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations, Graph transformations for efficient structural analysis, A sparse matrix approach to Bayesian computation in large linear models, Inverse-free recursive multiresolution algorithms for a data approximation problem, A variation on the interior point method for linear programming using the continued iteration, A finite-difference scheme overconvergent at certain mesh points, A block algorithm for computing rank-revealing QR factorizations, A hierarchical algorithm for making sparse matrices sparser, A parallel projection method for overdetermined nonlinear systems of equations, Randomized preprocessing of homogeneous linear systems of equations, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, Control of large-scale systems in a multiprocessor environment, A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices, How ordinary elimination became Gaussian elimination, New crash procedures for large systems of linear constraints, Analysis of the solution phase of a parallel multifrontal approach, An explicit formula for the inverse of arrowhead and doubly arrow matrices, Coreduction homology algorithm, Numerical study on incomplete orthogonal factorization preconditioners, Algebraic languages for mathematical programming, The effect of ordering on preconditioned conjugate gradients, Detecting embedded pure network structures in LP problems, Vector processing in simplex and interior methods for linear programming, LU factorization of non-standard forms and direct multiresolution solvers, Cost-effective sulphur emission reduction under uncertainty, An efficient direct method for fully conforming spectral collocation schemes, A nine-point finite volume scheme for the simulation of diffusion in heterogeneous media, A comparison of projective and direct solvers for finite elements in elastostatics, An implementation of Karmarkar's algorithm for linear programming, Multiprocessing a sparse matrix code on the Alliant FX/8, Modified incomplete orthogonal factorization methods using Givens rotations, Efficient iterative solution of the three-dimensional Helmholtz equation, An SQP method for general nonlinear programs using only equality constrained subproblems, Symbolic manipulation techniques for model simplification in object-oriented modelling of large scale continuous systems, Symbiosis between linear algebra and optimization, The impact of high-performance computing in the solution of linear systems: Trends and problems, A new matrix bandwidth reduction algorithm, Ordering algorithms for irreducible sparse linear systems, A fast LU update for linear programming, A parallel interior point algorithm for linear programming on a network of transputers, An optimum partition for inverting a nonsingular matrix, Advances in design and implementation of optimization software, Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers, Qualitative decomposition of the eigenvalue problem in a dynamic system, Some new results regarding spikes and a heuristic for spike construction, Computational experience with a primal-dual interior point method for linear programming, MOPS -- Mathematical optimization system, An iterative substructuring method for coupled fluid-solid acoustic problems, Road vehicle modeling requirements for optimization of ride and handling, Analysis and implementation of a dual algorithm for constrained optimization, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems, Preconditioning techniques for large linear systems: A survey, A comparison of stiff ODE solvers for astrochemical kinetics problems, Linear algebraic transformations of the bidomain equations: Implications for numerical methods, Interior point methods for power flow optimization with security constraints, Wavelets in hybrid-mixed stress elements, On the ordering of sparse linear systems, Partitioning ODE systems with an application to air pollution models, ARANEA, a program for generating unstructured triangular meshes with a JAVA graphics user interface, Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Solving linear systems in interior-point methods, Sparsity in higher order methods for unconstrained optimization, Globally Convergent Algorithm for Solving Large Nonlinear Systems of Equations, An approximate inverse matrix technique for arrowhead matrices, A sparsity for decomposing a symmetric matrix, Extended concept of stair-shape sparsity for the inverse of an asymmetric matrix, An object‐oriented interface for the dynamic memory management of sparse discrete mathematical operators in numerical scientific applications, A control volume finite-element method for numerical simulating incompressible fluid flows without pressure correction, A geometric framework for sparse matrix problems, Sparse matrix methods for unbalanced multifactor analysis of variance and covariance, High‐order hierarchical A‐ and L‐stable integration methods, A parallel row‐oriented sparse solution method for finite element structural analysis, Direct, partitioned and projected solution to finite element consolidation models, Unnamed Item, Unnamed Item, The column-updating method for solving nonlinear equations in Hilbert space, Parallel homotopy algorithm for symmetric large sparse eigenproblems, An extension of the theory of secant preconditioners, A nearly optimal preconditioner for the Navier–Stokes equations, A general iterative sparse linear solver and its parallelization for interval Newton methods, NEW PARALLEL STRATEGIES FOR BLOCK UPDATING THE QR DECOMPOSITION∗, Twisted factorization of a banded matrix, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Finite-element method for elastic wave propagation, An efficient preconditioned iterative solver for solving a coupled fluid structure interaction problem, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, Multi-domain dual reciprocity BEM approach for the Navier-Stokes system of equations, Experiences with sparse matrix solvers in parallel ODE software, A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations, Numerical simulation of mechanical systems using methods for differential‐algebraic equations, Alternating direction algorithms for solving Hamilton-Jacobi-Bellman equations, Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures, Newton's method for solving heat transfer, fluid flow and interface shapes in a floating molten zone, Preconditioned conjugate gradient methods for three‐dimensional linear elasticity, Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement, On a network method for unsteady incompressible fluid flow on triangular grids, On the Complexity of the Block Low-Rank Multifrontal Factorization, A spectral algorithm for envelope reduction of sparse matrices, An organization of sparse gauss elimination for solving partial differntial equations on distributed memory machines, Matrix-Free Convex Optimization Modeling, A discrete‐time approach to the steady state analysis and optimization of non‐linear autonomous circuits, Additive preconditioning and aggregation in matrix computations, Interior dual proximal point algorithm using preconditioned conjugate gradient †, Numerical performance of projection methods in finite element consolidation models, Making Bipartite Graphs DM-Irreducible, ILUT: A dual threshold incomplete LU factorization, Localization in Matrix Computations: Theory and Applications, Modular analysis of sequential solution methods for almost block diagonal systems of equations, Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives, Computing the smallest singular triplets of a large matrix, On the tree-depth of random graphs, A Guideline for Using the Multi-Domain BEM for Analyzing the Interior Acoustic Field, A Class of Iterative Solvers for the Helmholtz Equation: Factorizations, Sweeping Preconditioners, Source Transfer, Single Layer Potentials, Polarized Traces, and Optimized Schwarz Methods, Stability and inertia, Solving systems of elastic bar structures by preconditioned conjugate gradient method, An isochoric domain deformation method for computing steady free surface flows with conserved volumes, Optimization of a complex flexible multibody systems with composite materials, Composite materials in flexible multibody systems, State-of-the-Art Sparse Direct Solvers, An efficient algorithm for the solution of second order PDE’s using Taylor expansion polynomials, Symbolic elimination in dynamic optimization based on block-triangular ordering, Mathematical models in process engineering, Incomplete factorization by local exact factorization (ILUE), Parallel interior-point solver for structured quadratic programs: Application to financial planning problems, A parallel implementation of Wang's method for solving tridiagonal systems, An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation, Unnamed Item, Solving piecewise linear systems in ABS-normal form, Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III, A manifold-based approach to sparse global constraint satisfaction problems, A new approach to compute sparse approximate inverse factors of a matrix, Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming, An evaluation of limited-memory sparse linear solvers for thermo-mechanical applications, Loss and retention of accuracy in affine scaling methods, A clustering method based on multidimensional texture analysis, Combinatorial Aspects in Sparse Elimination Methods, The inertia of the symmetric approximation for low-rank matrices, $HP$-Adaptive Celatus Enriched Discontinuous Galerkin Method for Second-Order Elliptic Source Problems, Explicit isomorphic iterative methods for solving arrow-type linear systems, Parallelization of Advection-Diffusion-Chemistry Modules, Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization, Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos, Reversing the row order for the row-by-row frontal method, Study of parallel numerical methods for semiconductor device simulation, A frontal solver tuned for fully coupled non-linear hygro-thermo-mechanical problems, LPAKO: A Simplex-based Linear Programming Program, Recent computational developments in Krylov subspace methods for linear systems, A frictional contact algorithm for implicit material point method, Unnamed Item, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, Influence of modeling structure in probabilistic sequential decision problems, A class of incomplete orthogonal factorization methods. II: Implemetation and results, Sparsity in convex quadratic programming with interior point methods, Radial basis function methods for optimal control of the convection-diffusion equation: a numerical study, Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning, A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems, Improving Multifrontal Methods by Means of Block Low-Rank Representations, Diagonal Scaling of Ill-Conditioned Matrixes by Genetic Algorithm, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, An efficient method for computing the inverse of arrowhead matrices, DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations
