Pages that link to "Item:Q4371656"
From MaRDI portal
The following pages link to Computing the block triangular form of a sparse matrix (Q4371656):
Displaying 40 items.
- First-order chemical reaction networks. I: Theoretical considerations (Q338199) (← links)
- On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
- Local null controllability of the three-dimensional Navier-Stokes system with a distributed control having two vanishing components (Q481117) (← links)
- Efficient index reduction algorithm for large scale systems of differential algebraic equations (Q671058) (← links)
- Matchings, covers, and Jacobian matrices (Q671538) (← links)
- On the row merge tree for sparse LU factorization with partial pivoting (Q878210) (← links)
- Predicting the structure of sparse orthogonal factors (Q1318224) (← links)
- A clustering heuristic to detect staircase structures in large scale linear programming models (Q1331570) (← links)
- Using domain decomposition to find graph bisectors (Q1371661) (← links)
- Patterns that preserve sparsity in orthogonal factorization (Q1375102) (← links)
- A distance constrained synaptic plasticity model of \textit{C. elegans} neuronal network (Q1620376) (← links)
- From structural analysis to observer-based residual generation for fault detection (Q1784044) (← links)
- A geometric framework for sparse matrix problems (Q1883390) (← links)
- An algorithm for finding block-triangular forms (Q1914666) (← links)
- An efficient method for determining fault isolability properties based on an augmented system model (Q1996677) (← links)
- Index reduction of differential algebraic equations by differential Dixon resultant (Q2001625) (← links)
- A manifold-based approach to sparse global constraint satisfaction problems (Q2010101) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
- Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
- Preconditioners for rank deficient least squares problems (Q2297167) (← links)
- Distributed algebraic tearing and interconnecting techniques (Q2334804) (← links)
- Updating preconditioners for modified least squares problems (Q2360681) (← links)
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations (Q2408155) (← links)
- Matrices with two nonzero entries per row (Q2819775) (← links)
- Constrained Min-Cut Replication for <i>K</i>-Way Hypergraph Partitioning (Q2962559) (← links)
- DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY (Q3422212) (← links)
- Exploiting Block Triangular form for Solving DAEs: Reducing the Number of Initial Values (Q3459747) (← links)
- Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices (Q3537453) (← links)
- A Method for Sensor Placement Taking into Account Diagnosability Criteria (Q3601361) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form (Q4652297) (← links)
- An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
- A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs (Q5132024) (← links)
- Diagnosis of Partially Observed Petri Net Based on Analytical Redundancy Relationships (Q5213917) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Controllability of Coupled Parabolic Systems with Multiple Underactuations, Part 1: Algebraic Solvability (Q5234666) (← links)
- DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations (Q5270712) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- (Q5874548) (← links)
- Offline analysis of the relaxed upper boundedness for online estimation of optimal event sequences in partially observable Petri nets (Q6580668) (← links)