Algebraic and numerical techniques for the computation of matrix determinants (Q1368466): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5734756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to multiply matrices faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating signs of determinants using single-precision arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of cut polyhedra. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of cut polyhedra. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial face enumeration in convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi polygons and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient perturbations for handling geometric degeneracies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards exact geometric computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taylor expansion of the accumulated rounding error / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Computations with Matrices and Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of parallel matrix computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Dense Linear Algebra Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5535370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Modifying Matrix Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation Bounds for the $QR$ Factorization of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving linear least squares problems by Gram-Schmidt orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrization of Newton's iteration for computations with structured matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation of polynomial GCD and some related parallel computations over abstract fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving sparse linear equations over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939864 / rank
 
Normal rank

Revision as of 18:07, 27 May 2024

scientific article
Language Label Description Also known as
English
Algebraic and numerical techniques for the computation of matrix determinants
scientific article

    Statements

    Algebraic and numerical techniques for the computation of matrix determinants (English)
    0 references
    0 references
    28 September 1997
    0 references
    The authors study some effective approaches to the sign and singularity testing and to the computation of the determinant of a matrix. These problems have recently received a new major motivation, due to their important applications to geometric computations. The main goal in this paper is to demonstrate the power of combining algebraic and numerical computational techniques. It is shown that the resulting algorithms allow to obtain the solution by using a lower precision of computations and relatively few arithmetic operations.
    0 references
    rounding error analysis
    0 references
    determinant
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers