메뉴 건너뛰기




Volumn 4, Issue 2, 2005, Pages 87-127

Classical and quantum complexity of the sturm-liouville eigenvalue problem

Author keywords

Eigenvalue problem; Numerical approximation; Quantum algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; GATES (TRANSISTOR); INTEGRATION; MATRIX ALGEBRA; METHOD OF MOMENTS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

EID: 18844420784     PISSN: 15700755     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11128-005-4481-x     Document Type: Article
Times cited : (13)

References (32)
  • 1
    • 54249116319 scopus 로고
    • Eigenvalue problems
    • P. G. Ciarlet, J. L. Lions (eds.) (North-Holland, Amsterdam)
    • I. Babuska, and J. Osborn, Eigenvalue Problems, in Handbook of Numerical Analysis, Vol. II, P. G. Ciarlet, J. L. Lions (eds.) (North-Holland, Amsterdam, 1991) pp. 641-787.
    • (1991) Handbook of Numerical Analysis , vol.2 , pp. 641-787
    • Babuska, I.1    Osborn, J.2
  • 2
    • 0032313840 scopus 로고    scopus 로고
    • Proceedings of the quantum lower bounds by polynomials
    • R. Beals, H. Buhrman, M. Cleve, R. Mosca and R. de Wolf in Proceedings of the Quantum lower bounds by polynomials, FOCS'98, 1998, pp. 352-361. Also http://arXiv.org/quant-ph/9802049.
    • (1998) FOCS'98 , pp. 352-361
    • Beals, R.1    Buhrman, H.2    Cleve, M.3    Mosca, R.4    De Wolf, R.5
  • 4
    • 26944446616 scopus 로고    scopus 로고
    • A. J. Bessen, Phys. Rev. A 71, 042313 (2005). Also http://arXiv.org/ quant-ph/0412008.
    • (2005) Phys. Rev. a , vol.71 , pp. 042313
    • Bessen, A.J.1
  • 11
    • 84968473089 scopus 로고
    • H. Gary, Math. Comput. 19 (91), 365-379 (1965).
    • (1965) Math. Comput. , vol.19 , Issue.91 , pp. 365-379
    • Gary, H.1
  • 12
    • 4243807288 scopus 로고    scopus 로고
    • L. Graver, Phys. Rev. Lett., 79(2), 325-328 (1997). Also http://arXiv.org/quant-ph/9706033.
    • (1997) Phys. Rev. Lett. , vol.79 , Issue.2 , pp. 325-328
    • Graver, L.1
  • 13
    • 0036225247 scopus 로고    scopus 로고
    • S. Heinrich, J. Complexity 18(1), 1-50 (2002). Also http://arXiv.org/ quant-ph/0105116.
    • (2002) J. Complexity , vol.18 , Issue.1 , pp. 1-50
    • Heinrich, S.1
  • 15
    • 1242322161 scopus 로고    scopus 로고
    • S. Heinrich, J. Complexity 20, 5-26 (2004). Also http://arXiv.org/quant- ph/0305030.
    • (2004) J. Complexity , vol.20 , pp. 5-26
    • Heinrich, S.1
  • 16
    • 1242277383 scopus 로고    scopus 로고
    • S. Heinrich, J. Complexity 20, 27-45 (2004). Also http://arXiv.org/quant- ph/0305031.
    • (2004) J. Complexity , vol.20 , pp. 27-45
    • Heinrich, S.1
  • 20
    • 0032633492 scopus 로고    scopus 로고
    • The quantum query complexity of approximating the median and related statistics
    • A. Nayak and F. Wu, The quantum query complexity of approximating the median and related statistics, STOC 99, 384-393 (1999). Also http://arXiv.org/quant-ph/9804066.
    • (1999) STOC 99 , pp. 384-393
    • Nayak, A.1    Wu, F.2
  • 22
    • 0003211763 scopus 로고
    • Deterministic and stochastic error bounds in numerical analysis
    • Springer-Verlag, Berlin
    • E. Novak, Deterministic and Stochastic Error Bounds in Numerical Analysis, Lecture Notes in Mathematics 1349 (Springer-Verlag, Berlin, 1988).
    • (1988) Lecture Notes in Mathematics , vol.1349
    • Novak, E.1
  • 23
    • 0035294716 scopus 로고    scopus 로고
    • E. Novak, J. Complexity 17, 2-16 (2001). Also http://arXiv.org/quant-ph/ 0008124.
    • (2001) J. Complexity , vol.17 , pp. 2-16
    • Novak, E.1
  • 24
    • 0142051871 scopus 로고    scopus 로고
    • P. W. Shor, SIAM J. Comput. 26(5), 1484-1509 (1997).
    • (1997) SIAM J. Comput. , vol.26 , Issue.5 , pp. 1484-1509
    • Shor, P.W.1


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