Scholarlink

<p>Boundary value problems (BVPs) have wide applications in computer graphics and mechanical engineering. This paper presents a quasi-bounding method for progressively solving several boundary value problems, where initial solutions are easy to be obtained for rapidly solving the accurate solution. Given an equation <i>F</i>(<i>u, t</i>) = 0,<i>t</i> ∈ [<i>a</i>, <i>b</i>], and several boundary value constraints as well, two systems consisting of <i>n</i> + 1 equations are derived for rapidly searching two polynomials <i>f</i><sub><i>n</i>, 1</sub>(<i>t</i>) and <i>f</i><sub><i>n</i>, 2</sub>(<i>t</i>) of degree <i>n</i>, which satisfy <i>F</i>(<i>f</i><sub><i>n</i>, 1</sub>,<i>t</i>) ≤ 0 ≤ <i>F</i>(<i>f</i><sub><i>n</i>, 2</sub>, <i>t</i>),<i>t</i> ∈ [<i>a</i>, <i>b</i>] in the cases when certain conditions are satisfied. From the middle value theorem, the solution <i>u</i><sup>⋆</sup>(<i>t</i>) is bounded by <i>f</i><sub><i>n</i>, 1</sub>(<i>t</i>) and <i>f</i><sub><i>n</i>, 2</sub>(<i>t</i>), <i>t</i> ∈ [<i>a</i>, <i>b</i>]. These two bounding polynomials <i>f</i><sub><i>n</i>, <i>i</i></sub>(<i>t</i>), <i>i</i> = 1, 2, are taken as initial values for progressive refinements of approximation error in two ways, i.e., B-Spline form of the same degree with more knots, and Bézier form of a higher degree. Numerical experiments show that the new method can be applied to more generalized BVPs, and achieves better computational stability, much better approximation with less error and better computational efficiency than prevailing methods, even by using a small degree <i>n</i>.</p>

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

A Progressive Quasi-Bounding Method and Its Applications to Boundary Value Problems

  • 期刊论文

  • 发表日期：

    2026年7月18日

查看全文
  • Hong-Yu Chen,
  • Xiao-Diao Chen,
  • Wei-Yin Ma

摘要

Boundary value problems (BVPs) have wide applications in computer graphics and mechanical engineering. This paper presents a quasi-bounding method for progressively solving several boundary value problems, where initial solutions are easy to be obtained for rapidly solving the accurate solution. Given an equation F(u, t) = 0,t ∈ [a, b], and several boundary value constraints as well, two systems consisting of n + 1 equations are derived for rapidly searching two polynomials fn, 1(t) and fn, 2(t) of degree n, which satisfy F(fn, 1,t) ≤ 0 ≤ F(fn, 2, t),t ∈ [a, b] in the cases when certain conditions are satisfied. From the middle value theorem, the solution u⋆(t) is bounded by fn, 1(t) and fn, 2(t), t ∈ [a, b]. These two bounding polynomials fn, i(t), i = 1, 2, are taken as initial values for progressive refinements of approximation error in two ways, i.e., B-Spline form of the same degree with more knots, and Bézier form of a higher degree. Numerical experiments show that the new method can be applied to more generalized BVPs, and achieves better computational stability, much better approximation with less error and better computational efficiency than prevailing methods, even by using a small degree n.