메뉴 건너뛰기




Volumn , Issue , 2007, Pages 152-160

Null space and eigenspace computations with additive preprocessing

Author keywords

Additive preprocessing; Eigenspace computations; Ill conditioned matrices; Null space computations

Indexed keywords

LINEAR SYSTEMS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

EID: 36448940432     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1277500.1277523     Document Type: Conference Paper
Times cited : (6)

References (38)
  • 3
    • 1242307407 scopus 로고    scopus 로고
    • Inverse Power and Durand/Kerner Iteration for Univariate Polynomial Root-finding
    • January
    • D. A. Bini, L. Gemignani, V. Y. Pan, Inverse Power and Durand/Kerner Iteration for Univariate Polynomial Root-finding, Computers and Mathematics (with Applications), 47, 2/3, 447-459, January 2004.
    • (2004) Computers and Mathematics (with Applications) , vol.47 , Issue.2-3 , pp. 447-459
    • Bini, D.A.1    Gemignani, L.2    Pan, V.Y.3
  • 4
    • 36448975914 scopus 로고    scopus 로고
    • (Also Technical Reports TR 2002 003 and 2002 020, CUNY Ph.D. Program in Computer Science, Graduate Center, City University of New York, 2002.)
    • (Also Technical Reports TR 2002 003 and 2002 020, CUNY Ph.D. Program in Computer Science, Graduate Center, City University of New York, 2002.)
  • 5
    • 23344445986 scopus 로고    scopus 로고
    • Improved Initialization of the Accelerated and Robust QR-like Polynomial Root-finding
    • D. A. Bini, L. Gemignani, V. Y. Pan, Improved Initialization of the Accelerated and Robust QR-like Polynomial Root-finding, Electronic Transactions on Numerical Analysis, 17, 195-205, 2004.
    • (2004) Electronic Transactions on Numerical Analysis , vol.17 , pp. 195-205
    • Bini, D.A.1    Gemignani, L.2    Pan, V.Y.3
  • 6
    • 84947068118 scopus 로고    scopus 로고
    • Fast and Stable QR Eigenvalue Algorithms for Generalized Companion Matrices and Secular Equation
    • D. A. Bini, L. Gemignani, V. Y. Pan, Fast and Stable QR Eigenvalue Algorithms for Generalized Companion Matrices and Secular Equation, Numerische Math., 3, 373-408, 2005.
    • (2005) Numerische Math , vol.3 , pp. 373-408
    • Bini, D.A.1    Gemignani, L.2    Pan, V.Y.3
  • 8
    • 85023205150 scopus 로고
    • Matrix Multiplicaton via Arithmetic Progressions
    • D. Coppersmith, S. Winograd, Matrix Multiplicaton via Arithmetic Progressions, J. of Symbolic Computation, 9, 3, 251-280, 1990.
    • (1990) J. of Symbolic Computation , vol.9 , Issue.3 , pp. 251-280
    • Coppersmith, D.1    Winograd, S.2
  • 10
    • 0036335550 scopus 로고    scopus 로고
    • An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials
    • S. Fortune, An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials, J. of Symbolic Computation, 33, 5, 627-646, 2002.
    • (2002) J. of Symbolic Computation , vol.33 , Issue.5 , pp. 627-646
    • Fortune, S.1
  • 12
    • 0004236492 scopus 로고    scopus 로고
    • 3rd edition, The Johns Hopkins University Press, Baltimore, Maryland
    • G. H. Golub, C. F. Van Loan, Matrix Computations, 3rd edition, The Johns Hopkins University Press, Baltimore, Maryland, 1996.
    • (1996) Matrix Computations
    • Golub, G.H.1    Van Loan, C.F.2
  • 14
    • 0031166040 scopus 로고    scopus 로고
    • Computing an Eigenvector with Inverse Iteration
    • I. C. F. Ipsen, Computing an Eigenvector with Inverse Iteration, SIAM Review, 39, 354-391, 1998.
    • (1998) SIAM Review , vol.39 , pp. 354-391
    • Ipsen, I.C.F.1
  • 15
    • 0033265553 scopus 로고    scopus 로고
    • A Practical Algorithm for Faster Matrix Multiplication
    • I. Kaporin, A Practical Algorithm for Faster Matrix Multiplication, Numerical Linear Algebra with Applications, 6, 8, 687-700, 1999.
    • (1999) Numerical Linear Algebra with Applications , vol.6 , Issue.8 , pp. 687-700
    • Kaporin, I.1
  • 16
    • 2142700139 scopus 로고    scopus 로고
    • The Aggregation and Cancellation Techniques As a Practical Tool for Faster Matrix Multiplication
    • I. Kaporin, The Aggregation and Cancellation Techniques As a Practical Tool for Faster Matrix Multiplication, Theoretical Computer Science, 315, 2-3, 469-510, 2004.
    • (2004) Theoretical Computer Science , vol.315
    • Kaporin, I.1
  • 17
    • 38249013295 scopus 로고
    • On Practical Algorithms for Accelerated Matrix Multiplication
    • J. Laderman, V. Y. Pan, H. X. Sha, On Practical Algorithms for Accelerated Matrix Multiplication, Linear Algebru and Its Applications, 162-164, 557-588, 1992.
    • (1992) Linear Algebru and Its Applications , vol.162-164 , pp. 557-588
    • Laderman, J.1    Pan, V.Y.2    Sha, H.X.3
  • 22
    • 0021452919 scopus 로고
    • Speed up Matrix Multiplication?
    • V. Y. Pan, How Can We Speed up Matrix Multiplication? SIAM Review, 26, 3, 393-415, 1984.
    • (1984) SIAM Review , vol.26 , Issue.3 , pp. 393-415
    • Pan, V.Y.1    How Can, W.2
  • 23
    • 0031169815 scopus 로고    scopus 로고
    • Solving a Polynomial Equation: Some History and Recent Progress
    • V. Y. Pan, Solving a Polynomial Equation: Some History and Recent Progress, SIAM Review, 39, 2, 187-220, 1997.
    • (1997) SIAM Review , vol.39 , Issue.2 , pp. 187-220
    • Pan, V.Y.1
  • 25
    • 36448952798 scopus 로고    scopus 로고
    • On Eigen-solving via Reduction to DPR1 Matrices
    • preprint
    • V. Y. Pan, On Eigen-solving via Reduction to DPR1 Matrices, preprint, 2007.
    • (2007)
    • Pan, V.Y.1
  • 27
    • 36448994510 scopus 로고    scopus 로고
    • V. Y. Pan, D. Ivolgin, B. Murphy, R. E. Rosholt, I. Taj-Eddin, Y. Tang, X. Yan, Additive Preconditioning and Aggregation in Matrix Computations, Technical Report TR 2006006, CUNY Ph.D. Program in Computer Science, Graduate Center, City University of New York, May 2006.
    • V. Y. Pan, D. Ivolgin, B. Murphy, R. E. Rosholt, I. Taj-Eddin, Y. Tang, X. Yan, Additive Preconditioning and Aggregation in Matrix Computations, Technical Report TR 2006006, CUNY Ph.D. Program in Computer Science, Graduate Center, City University of New York, May 2006.
  • 28
    • 36448966064 scopus 로고    scopus 로고
    • V. Y. Pan, D. Ivolgin, B. Murphy, R. E. Rosholt, Y. Tang, X. Wang, X. Yan, Root-finding with Eigen-solving, pages 219-245 in Symbolic-Numerical Computation, (Dongming Wang and Lihong Zhi editors), Birkhäuser, Basel/Boston, 2007.
    • V. Y. Pan, D. Ivolgin, B. Murphy, R. E. Rosholt, Y. Tang, X. Wang, X. Yan, Root-finding with Eigen-solving, pages 219-245 in Symbolic-Numerical Computation, (Dongming Wang and Lihong Zhi editors), Birkhäuser, Basel/Boston, 2007.
  • 35
    • 33748875998 scopus 로고    scopus 로고
    • Matrix Algorithms
    • SIAM, Philadelphia
    • G. W. Stewart, Matrix Algorithms, Vol I: Basic Decompositions, SIAM, Philadelphia, 1998.
    • (1998) Basic Decompositions , vol.1
    • Stewart, G.W.1
  • 36
    • 33746243736 scopus 로고    scopus 로고
    • Matrix Algorithms
    • SIAM, Philadelphia
    • G. W. Stewart, Matrix Algorithms, Vol II: Eigensystems, SIAM, Philadelphia, 2001.
    • (2001) Eigensystems , vol.2
    • Stewart, G.W.1
  • 38
    • 36448947704 scopus 로고    scopus 로고
    • Affect of Small Rank Modification on the Condition Number of a Matrix
    • in print
    • X. Wang, Affect of Small Rank Modification on the Condition Number of a Matrix, Computer and Math. (with Applications), in print.
    • Computer and Math. (with Applications)
    • Wang, X.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.