symrcm

MaRDI QIDQ20575swMATHFDO

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

Cited in

(only showing first 100 items - show all)

• A method for calculation of a high-frequency discharge
• Real valued iterative methods for solving complex symmetric linear systems
• A two‐step approach to finite element ordering
• An explicit link between Gaussian fields and Gaussian Markov random fields: the stochastic partial differential equation approach
• Solving quadratically constrained convex optimization problems with an interior-point method
• On updating the structure of sparse matrix factors
• Simulated annealing for profile and fill reduction of sparse matrices
• Generalized structured additive regression based on Bayesian P-splines
• scientific article; zbMATH DE number 3885206 (Why is no real title available?)
• Multiscale matrix sampling and sublinear-time PageRank computation
• An efficient simplex type algorithm for sparse and dense linear programs.
• Direct Finite Element Computation of Periodic Adsorption Processes
• Gaussian process emulators for the stochastic finite element method
• Smooth interpolation to scattered data by bivariate piecewise polynomials of odd degree
• Preconditioning techniques for large linear systems: A survey
• Sparse matrix factor modification in structural reanalysis
• On sparse matrix orderings in interior point methods
• A dynamic finite element preanalyser
• Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
• Bandwidth on AT-free graphs
• Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver
• LU decomposition of M-matrices by elimination without pivoting
• An \(O(N)\) parallel method of computing the log-Jacobian of the variable transformation for models with spatial interaction on a lattice
• Sparse matrix tools for Gaussian models on lattices
• A survey of direct methods for sparse linear systems
• Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications
• A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
• scientific article; zbMATH DE number 2098313 (Why is no real title available?)
• Linear algebra on high performance computers
• Fast cars
• An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
• A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
• Separation-of-variables as a preconditioner for an iterative Helmholtz solver
• scientific article; zbMATH DE number 1174760 (Why is no real title available?)
• Detecting fixed patterns in chordal graphs in polynomial time
• An efficient analyse phase for element problems.
• Finite Element Methods for Nonlinearly Viscous Fluids
• 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
• Numerical linear algebra algorithms and software
• On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations
• A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
• Estimation of spatial autoregressive models with measurement error for large data sets
• A scalable, matrix-free multigrid preconditioner for finite element discretizations of heterogeneous Stokes flow
• Tree decomposition and discrete optimization problems: a survey
• Hybrid methods for large sparse nonlinear least squares
• Sparse matrices
• Rank-adaptive structure-preserving model order reduction of Hamiltonian systems
• A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems
• Iterative ILU preconditioners for linear systems and eigenproblems
• On the solution of determinantal systems of linear inequalities
• A linear time implementation of the reverse Cuthill-McKee algorithm
• Refining an approximate inverse
• Bandwidth of bipartite permutation graphs in polynomial time
• The hierarchical basis multigrid method for convection-diffusion equations
• Sparse linear problems and the least squares method
• On the ordering of sparse linear systems
• Sparse matrix element topology with application to AMG(e) and preconditioning
• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
• Two-level preconditioner via a rigid body-based aggregation for the Schur complement system
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
• Solving linear systems in interior-point methods
• Feasibility issues in a primal-dual interior-point method for linear programming
• Iterative methods for overflow queueing models. I
• SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER
• Factoring matrices with a tree-structured sparsity pattern
• Weighted graph based ordering techniques for preconditioned conjugate gradient methods
• Fast power flow scheduling and sensitivity analysis for sizing a microgrid with storage
• Sparse Matrices in MATLAB: Design and Implementation
• Equivalence between lowest-order mixed finite element and multi-point finite volume methods on simplicial meshes
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• Heuristics for matrix bandwidth reduction
• An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
• The danger of combining block red-black ordering with modified incomplete factorizations and its remedy by perturbation or relaxation
• A parallel computational model for the finite element method on a memory- sharing multiprocessor computer
• Fitting very large sparse Gaussian graphical models
• Stress-based finite element analysis of plane plasticity problems
• A block version of left-looking AINV preconditioner with one by one or two by two block pivots
• Efficient mesh management in firedrake using PETSc DMPlex
• Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs
• Matrix reordering using multilevel graph coarsening for ILU preconditioning
• Symbiosis between linear algebra and optimization
• Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
• Fast linear equation solvers in high performance electromagnetic field analysis
• The BPMPD interior point solver for convex quadratic problems
• Modifying a graph using vertex elimination
• Stable, high-order discretization for evolution of the wave equation in \(2+1\) dimensions
• Estimating the matrix p-norm
• Highly efficient optimization mesh movement method based on proper orthogonal decomposition
• Using domain decomposition to find graph bisectors
• Computing a Sparse Basis for the Null Space
• An optimization modeling for customer redistribution and its spreadsheet implementation
• Linear and non‐linear iterative methods for the incompressible Navier‐Stokes equations
• An algorithm for solving singular perturbation problems with mechanization
• Numerical homogenization: survey, new results, and perspectives
• On factored discretizations of the Laplacian for the fast solution of Poisson's equation on general regions
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• Stable, high-order discretization for evolution of the wave equation in 1 + 1 dimensions.
• Techniques for parallel manipulation of sparse matrices

This page was built for software: symrcm