"Lanczos approximation"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎메타데이터: 새 문단)
 
23번째 줄: 23번째 줄:
 
  <references />
 
  <references />
  
== 메타데이터 ==
+
==메타데이터==
 
 
 
===위키데이터===
 
===위키데이터===
 
* ID :  [https://www.wikidata.org/wiki/Q6483801 Q6483801]
 
* ID :  [https://www.wikidata.org/wiki/Q6483801 Q6483801]
 +
===Spacy 패턴 목록===
 +
* [{'LOWER': 'lanczos'}, {'LEMMA': 'approximation'}]

2021년 2월 17일 (수) 00:48 기준 최신판

노트

위키데이터

말뭉치

  1. The Lanczos approximation is a particularly effective method for computing values of the Gamma function to high precision.[1]
  2. To facilitate an elegant C++ implementation of the Lanczos approximation, I have written a partial C++ wrapper for the floating point functions of GMP.[1]
  3. The Lanczos approximation has fewer of these problems, provided that the coefficients are computed accurately enough.[2]
  4. The Lanczos Approximation as implemented in the Boost C++ Libraries.[2]
  5. We report that for fixed real parts of the free parameter that using complex coefficients both increases the computational cost of the Lanczos approximation while drecreasing the accuracy...[3]
  6. In mathematics, the Lanczos approximation is a method for computing the Gamma function numerically, published by Cornelius Lanczos in 1964.[4]
  7. For a well-chosen constant g and a small number of terms in the series, the Lanczos approximation is accurate to within floating-point precision.[5]
  8. In mathematics, the Lanczos approximation is a method for computing the gamma function numerically, published by Cornelius Lanczos in 1964.[6]
  9. Among others, the Padé-via-Lanczos approximation provides an efficient solution.[7]
  10. The Lanczos approximation is used to calculate Gamma function numerically.[8]
  11. The Lanczos approximation is a method for computing the Gamma function numerically, published by Cornelius Lanczos in 1964.[8]
  12. Using Lanczos Approximation.[9]
  13. In this paper, we use the idea of thick-restart and adaptive preconditioning for solving linear systems to improve convergence of the Lanczos approximation.[10]
  14. 𝑣 ℓ + 1 for the Lanczos approximation, so that the vectors 𝑟 ℓ ≡ 𝑟 ℓ ( 0 ) and 𝑟 ℓ ( 𝑡 ) are aligned; however their magnitudes are different.[10]
  15. It is also worth pointing out that the Lanczos approximation for this preconditioned matrix function reduces much more rapidly than for the case where preconditioning (dotted line) is not used.[10]
  16. The Lanczos approximation in this example again lies almost entirely on the curve that represents the optimal approximation obtainable from the Krylov subspace.[10]

소스

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'lanczos'}, {'LEMMA': 'approximation'}]