Triangular decomposition

Results: 37



#Item
1Computing Cylindrical Algebraic Decomposition via Triangular Decomposition Changbo Chen, Marc Moreno Maza, Bican Xia and Lu Yang University of Western Ontario, Canada Massachusetts Institute of Technology, USA

Computing Cylindrical Algebraic Decomposition via Triangular Decomposition Changbo Chen, Marc Moreno Maza, Bican Xia and Lu Yang University of Western Ontario, Canada Massachusetts Institute of Technology, USA

Add to Reading List

Source URL: issac2009.kias.re.kr

- Date: 2009-07-31 11:27:57
    2Gaussian Elimination with (Partial) Pivoting At the kth stage of Gaussian elimination: • Search the kth column on and below the diagonal for the largest entry.

    Gaussian Elimination with (Partial) Pivoting At the kth stage of Gaussian elimination: • Search the kth column on and below the diagonal for the largest entry.

    Add to Reading List

    Source URL: www.mathcs.emory.edu

    Language: English - Date: 2014-08-21 18:13:12
    3Use of Semi-separable Approximate Factorization and Direction-preserving for Constructing Effective Preconditioners X. Sherry Li Lawrence Berkeley National Laboratory Ming Gu (UC Berkeley)

    Use of Semi-separable Approximate Factorization and Direction-preserving for Constructing Effective Preconditioners X. Sherry Li Lawrence Berkeley National Laboratory Ming Gu (UC Berkeley)

    Add to Reading List

    Source URL: crd-legacy.lbl.gov

    Language: English - Date: 2010-03-18 15:12:23
    4SIAM J. MATRIX ANAL. APPL. Vol. 35, No. 2, pp. 684–698 c 2014 Society for Industrial and Applied Mathematics 

    SIAM J. MATRIX ANAL. APPL. Vol. 35, No. 2, pp. 684–698 c 2014 Society for Industrial and Applied Mathematics 

    Add to Reading List

    Source URL: www.ti3.tu-harburg.de

    Language: English - Date: 2014-06-11 02:30:25
    5On the complexity of computing with zero-dimensional triangular sets ´ Adrien Poteaux? Eric Schost†

    On the complexity of computing with zero-dimensional triangular sets ´ Adrien Poteaux? Eric Schost†

    Add to Reading List

    Source URL: www.csd.uwo.ca

    Language: English - Date: 2011-11-11 00:11:01
    6Abstract  Abstract This work deals with the parallelization of the LUP triangular matrix decomposition over a finite field Z/pZ. This computation is motivated by numerous applications, including algebraic attacks with p

    Abstract Abstract This work deals with the parallelization of the LUP triangular matrix decomposition over a finite field Z/pZ. This computation is motivated by numerous applications, including algebraic attacks with p

    Add to Reading List

    Source URL: jncf2013.imag.fr

    Language: English - Date: 2013-05-10 06:31:41
      7Block Cholesky Algorithms Dr. Peter A. Steeves, P. Eng. Geodetic Software Systems A set of normal equations may be expressed in matrix notation as N ⋅ X  =

      Block Cholesky Algorithms Dr. Peter A. Steeves, P. Eng. Geodetic Software Systems A set of normal equations may be expressed in matrix notation as N ⋅ X =

      Add to Reading List

      Source URL: webhome.idirect.com

      Language: English - Date: 2002-02-19 11:40:34
      8EE103 (FallQR factorization • solving the normal equations • QR factorization

      EE103 (FallQR factorization • solving the normal equations • QR factorization

      Add to Reading List

      Source URL: www.seas.ucla.edu

      Language: English - Date: 2011-10-14 12:42:11
      9

      PDF Document

      Add to Reading List

      Source URL: icis.pcz.pl

      Language: English - Date: 2005-09-12 07:47:58