symrcm

MaRDI QIDQ20575swMATHFDO

Official website http://www.mathworks.de/de/help/matlab/ref/symrcm.html

Cited in

(only showing first 100 items - show all)

• The chebop system for automatic solution of differential equations
• Simultaneous selection of variables and smoothing parameters in structured additive regression models
• A comparison of projective and direct solvers for finite elements in elastostatics
• On the use of inexact subdomain solvers for BDDC algorithms
• Fixed-domain asymptotic properties of tapered maximum likelihood estimators
• Bandwidth of bipartite permutation graphs in polynomial time
• A sparse counterpart of Reichel and Gragg's package QRUP
• Convergence of a direct-iterative method for large-scale least-squares problems
• Algorithms for the reduction of matrix bandwidth and profile
• Solution algorithms for nonlinear transient heat conduction analysis employing element-by-element iterative strategies
• Derivative generation from multivariate scattered data by functional minimization
• Iterative methods for overflow queueing models. I
• Parallel Cholesky factorization on a shared-memory multiprocessor
• A pipelined Givens method for computing the QR factorization of a sparse matrix
• Parallel triangularization of substructured finite element problems
• Quotient tree partitioning of undirected graphs
• Approximation by cubic C^ 1-splines on arbitrary triangulations
• Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
• Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
• Linear algebra on high performance computers
• Improving Jacobi and Gauss-Seidel iterations
• A sparse sequential quadratic programming algorithm
• Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks
• A survey of the advances in the exploitation of the sparsity in the solution of large problems
• Solution of sparse positive definite systems on a shared-memory multiprocessor
• The analysis of a nested dissection algorithm
• On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations
• Sparse linear problems and the least squares method
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• A direct method for sparse least squares problems with lower and upper bounds
• Algebraic multilevel preconditioning methods. I
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• Techniques for parallel manipulation of sparse matrices
• Solution of sparse positive definite systems on a hypercube
• Conditioning analysis of positive definite matrices by approximate factorizations
• On symbolic factorization of partitioned sparse symmetric matrices
• Solution of sparse linear least squares problems using Givens rotations
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• LU decomposition of M-matrices by elimination without pivoting
• LU decompositions of generalized diagonally dominant matrices
• Conditioning analysis of sparse block approximate factorizations
• The hierarchical basis multigrid method for convection-diffusion equations
• The average parallel complexity of Cholesky factorization
• Lower eigenvalue bounds for singular pencils of matrices
• Towards a cost-effective ILU preconditioner with high level fill
• A barrier method for dynamic Leontief-type linear programs
• Compact finite difference schemes with spectral-like resolution
• Consistent sparse factorization
• Analytical bounds for block approximate factorization methods
• A parallel projection method for overdetermined nonlinear systems of equations
• A chordal preconditioner for large-scale optimization
• Approximate factorizations with S/P consistently ordered M-factors
• Incomplete factorizations of singular linear systems
• The effect of ordering on preconditioned conjugate gradients
• Preconditioning of the \(p\)-version of the finite element method
• Krylov methods for solving models with forward-looking variables
• FIDAP
• ALPO
• ARMS
• Comparison of two methods for solving linear equations occurring in molecular dynamics applications
• A direct parallel sparse matrix solver
• BPMPD
• COLAMD
• CsegGraph
• Domain decomposition preconditioning in the hierarchical \(p\)-version of the finite element method
• A new efficient algorithm for computing Gröbner bases (F₄)
• EDGE
• Monte Carlo estimates of the log determinant of large sparse matrices
• Gb
• Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
• Predicting the structure of sparse orthogonal factors
• IPMLO
• Analysis and implementation of a dual algorithm for constrained optimization
• An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations
• An analysis of the composite step biconjugate gradient method
• Solving simultaneous linear equations using recurrent neural networks
• Repeated red-black ordering: A new approach
• Algorithm for random close packing of spheres with periodic boundary conditions
• ODRPACK
• A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
• Graph perturbations
• Computer simulation and modeling in railway applications
• PSPASES
• HyperX
• The convergence of parallel iteration algorithms for linear complementarity problems
• A graph-theoretic model of symmetric Givens operations and its implications
• Calculation of incompressible viscous flows by an unconditionally stable projection FEM
• The preconditioned conjugate gradient method with incomplete factorization preconditioners
• Separators and structure prediction in sparse orthogonal factorization
• The prolonged adaptive multigrid method for finite element Navier-Stokes equations
• Nonlinear iteration methods for high speed laminar compressible Navier-Stokes equations
• Using domain decomposition to find graph bisectors
• Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
• A parallel solver for the hp-version of finite element methods
• A local solution adapted Tri-Tree multigrid generator and iterative equation solver for mixed finite element formulation of the Navier-Stokes equations
• Experimental study of ILU preconditioners for indefinite matrices
• Sparse spatial autoregressions
• PLTMGC
• SPICE
• Parallel solution techniques in computational structural mechanics

This page was built for software: symrcm