scientific article

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

ordering Gaussian elimination Fortran fill-in orthogonal factorization symmetric positive definite dynamic storage allocation sparse matrix algorithm sparse block-partitioned matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) 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

Analysis of bending of composite plates with account for the difference in resistance to tension and compression, Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results, A SET OF HYBRID EQUILIBRIUM FINITE ELEMENT MODELS FOR THE ANALYSIS OF THREE-DIMENSIONAL SOLIDS, Upper bound limit analysis with a parallel mixed finite element formulation, On the direct parallel solution of systems of linear equations: New algorithms and systolic structures, Unnamed Item, Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography, A survey of the advances in the exploitation of the sparsity in the solution of large problems, On the static interaction of fluid and gas loaded multi-chamber systems in large deformation finite element analysis, Finite-difference analysis of borehole flows involving domain contractions around three-dimensional anomalies, Finite element applications on a shared-memory multiprocessor: Algorithms and experimental results, Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods, Decomposition in multidimensional Boolean-optimization problems with sparse matrices, On algebras and applications of operators with pseudosparse matrices, Comparison of iterative and direct solution methods for viscous flow calculations in body-fitted co-ordinates, Some useful renumbering strategies for unstructured grids, MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗, Some aspects of finite element calculations applied to ULF magnetospheric cavity waves, Solving sparse linear systems by an ABS-method that corresponds to LU- decomposition, Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver), A method of solving systems of nonlinear equations of large dimension with banded Jacobian matrix, A hybrid-mixed finite element model based on Legendre polynomials for Reissner-Mindlin plates, Matrices whose inverses are tridiagonal, band or block-tridiagonal and their relationship with the covariance matrices of a random Markov process, Torsional vibration analysis of a multi-body single cylinder internal combustion engine model, Hybrid methods for large sparse nonlinear least squares, A new set of piecewise constant orthogonal functions for the analysis of linear SISO systems with sample-and-hold, Mathematical modelling of flagellated microswimmers, A general approach for using a stiff equation solver to integrate a system of partial differential equations, Performance of certain iterative methods in solving implicit difference schemes for 2-D Navier-Stokes equations, An interior-point implementation developed and tuned for radiation therapy treatment planning, A spectral algorithm for envelope reduction of sparse matrices, Spectral properties of anti-heptadiagonal persymmetric Hankel matrices, Fast Solvers for Systems of Linear Equations with Block-Band Matrices, Adaptive algorithms for solving eigenvalue problems in the variable computer environment of supercomputers, Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices, Shape optimization with hybrid-Trefftz displacement elements, Algebraic multilevel iteration method for Stieltjes matrices, A matrix-based VaR model for risk identification in power supply networks, A Guideline for Using the Multi-Domain BEM for Analyzing the Interior Acoustic Field, A parallel algorithm for solving a partial eigenvalue problem for block-diagonal bordered matrices, Formulation of elastostatic hybrid-Trefftz stress elements, Derivation and testing of explicit equations of motion for polymers described by internal coordinates, Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method, Selection of fictitious independent variables for the solution of sparse linear equations, Eigenvalue calculation procedure for an Euler/Navier-Stokes solver with application to flows over airfoils, Bandwidth of graphs resulting from the edge clique covering problem, Graph transformations for efficient structural analysis, On optimizing multiplications of sparse matrices, Application of semiorthogonal spline wavelets and the Galerkin method to the numerical simulation of thin wire antennas, Numerical solution of third order linear differential equations using generalized one-shot operational matrices in orthogonal hybrid function domain, Fast and efficient linear programming and linear least-squares computations, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, On the ordering of sparse linear systems, Unnamed Item, Application of the Cramer rule in the solution of sparse systems of linear algebraic equations, Comparison of Lanczos and CGS solvers for solving numerical heat transfer problems, Algebraic languages for mathematical programming, Some Geometric and Algebraic Aspects of Domain Decomposition Methods, Embedding capacity estimation of reversible watermarking schemes, Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization, Efficient parallel linear programming, Efficient emulators of computer experiments using compactly supported correlation functions, with an application to cosmology, Sequential Monte Carlo Techniques for Solving Non-Linear Systems, Generalized eigenvalue problems: Lanczos algorithm with a recursive partitioning method, Fixed-domain asymptotic properties of tapered maximum likelihood estimators, Unnamed Item, Speeding up deciphering by hypergraph ordering, Unnamed Item, LOQO:an interior point code for quadratic programming, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, A new preconditioning technique for solving large sparse linear systems, Addressing the envelope reduction of sparse matrices using a genetic programming system