Scholarlink

<p>In this work, we focus on the computation of the zeros of a monic Laguerre–Sobolev orthogonal polynomial of degree <i>n</i>. Taking into account the associated four–term recurrence relation, this problem can be formulated as a generalized eigenvalue problem, involving a lower bidiagonal matrix and a 2–banded lower Hessenberg matrix of order <i>n</i>. Unfortunately, the considered generalized eigenvalue problem is very ill–conditioned, and classical balancing procedures do not improve it. Therefore, customary techniques for solving the generalized eigenvalue problem, like the <i>QZ</i> method, yield unreliable results. Here, we propose a novel balancing procedure that drastically reduces the ill–conditioning of the eigenvalues of the involved matrix pencil. Moreover, we propose a fast and reliable algorithm, with <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\( \mathcal {O}(n^2) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mo stretchy="false">(</mo> <msup> <mi>n</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> computational complexity and <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\( \mathcal {O}(n) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> memory, exploiting the structure of the considered matrix pencil.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On computing the zeros of Laguerre–Sobolev polynomials

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年2月8日

查看全文
  • T. Laudadio,
  • N. Mastronardi,
  • F. J. Marcellán Español,
  • N. Van Buggenhout,
  • P. Van Dooren

摘要

In this work, we focus on the computation of the zeros of a monic Laguerre–Sobolev orthogonal polynomial of degree n. Taking into account the associated four–term recurrence relation, this problem can be formulated as a generalized eigenvalue problem, involving a lower bidiagonal matrix and a 2–banded lower Hessenberg matrix of order n. Unfortunately, the considered generalized eigenvalue problem is very ill–conditioned, and classical balancing procedures do not improve it. Therefore, customary techniques for solving the generalized eigenvalue problem, like the QZ method, yield unreliable results. Here, we propose a novel balancing procedure that drastically reduces the ill–conditioning of the eigenvalues of the involved matrix pencil. Moreover, we propose a fast and reliable algorithm, with \( \mathcal {O}(n^2) \) O ( n 2 ) computational complexity and \( \mathcal {O}(n) \) O ( n ) memory, exploiting the structure of the considered matrix pencil.