Sparse matrices

zbMath0262.65021MaRDI QIDQ5921604

Reginald P. Tewarson

Publication date: 1973

Published in: Mathematics in Science and Engineering (Search for Journal in Brave)

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical linear algebra (65Fxx)

Related Items (48)

Profile minimization problem for matrices and graphs ⋮ A method for solving algebraic systems consisting of linear and nonlinear equations ⋮ Unnamed Item ⋮ Design of an atomized organization structure: a graph-theoretic approach ⋮ A variable neighborhood search and simulated annealing hybrid for the profile minimization problem ⋮ Unnamed Item ⋮ Optimum and suboptimum methods for permuting a matrix into bordered triangular form ⋮ A general approach to circuit equations ⋮ Application of graphs to the Gaussian elimination method ⋮ Use of incomplete decomposition of the coefficient matrix in solving linear equations ⋮ Computational methods of linear algebra ⋮ Unnamed Item ⋮ Letters to the editor ⋮ A Guideline for Using the Multi-Domain BEM for Analyzing the Interior Acoustic Field ⋮ Continuation algorithms for the eigenvalue problems ⋮ An improved estimate for the highest Lyapunov exponent in the method of freezing ⋮ On optimizing multiplications of sparse matrices ⋮ Rotating boson stars using finite differences and global Newton methods ⋮ A Hierarchical Representation of the Inverse for Sparse Matrices ⋮ Computational complexity of operations involving perfect elimination sparse matrices ⋮ Computer program for solution of large, sparse, unsymmetric systems of linear equations ⋮ A graph theoretical interpretation of nonsymmetric permutation on sparse matrices ⋮ A hybrid algorithm for reducing matrix bandwidth ⋮ The NP-completeness of the bandwidth minimization problem ⋮ The solution of sparse linear equations by the conjugate gradient method ⋮ A numerical method for solving two-point boundary value problems for nonlinear ordinary differential equations ⋮ On the use of splines for the numerical solution of nonlinear two-point boundary value problems ⋮ Computational aspects of matrix generalized inversion for the computer with applications ⋮ An algorithm for reducing the moment of inertia of a system interaction matrix ⋮ Discrete weighted residual methods Multi-interval methods ⋮ The Dynamic Behaviour of Non-Homogeneous Single-Unireducible Markov and Semi-Markov Chains ⋮ Identification and analysis of the subsystem structure of models ⋮ Node Reordering algorithms for water network analysis ⋮ Solution of water networks by sparse matrix methods ⋮ Number of operations for updating the elimination form of the basis- inverse of the revised simplex-algorithm ⋮ A new shortest path updating algorithm ⋮ Optimization of large-scale complex systems ⋮ Kinematic stationary geodynamo models with separated toroidal and poloidal motions ⋮ On the optimal choice of pivots for the Gaussian elimination ⋮ A desirable form for sparse matrices when computing their inverse in factored forms ⋮ Design of a recursive, shape controlling mesh generator ⋮ Speeding up deciphering by hypergraph ordering ⋮ Band algorithm for unsymmetric matrices in finite element and semi-discrete methods ⋮ A quasi-Newton method with sparse triple factorization for unconstrained minimization ⋮ Block-indexed solution of very large linear equation systems with symmetric dbbf coefficient matrix ⋮ A comparison of gaussian and gauss-jordan elimination in regular algebra ⋮ Cardinality-Based Inference Control in Sum-Only Data Cubes ⋮ Construction and efficient implementation of implicit preconditioning methods. II

This page was built for publication: Sparse matrices