Springer Science and Business Media LLC
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
A generalization of singly-implicit methods
Springer Science and Business Media LLC - Tập 21 - Trang 175-189 - 1981
Singly-implicit Runge-Kutta methods are characterized by a one-point spectrum property of the coefficient matrix. If a method of this type is also a collocation method, then its abscissae are proportional to the zeros of a Laguerre polynomial. The generalization introduced here is a multistep method in the style of Nordsieck and also a multistage method under the one-point spectrum constraint. It ......
Convex interval interpolation with cubic splines, II
Springer Science and Business Media LLC - Tập 31 - Trang 328-340 - 1991
The problem of convex interval interpolation with cubicC
1-splines has an infinite number of solutions, if it is solvable at all. For selecting one of the solutions a regularized mean curvature is minimized. The arising finite dimensional constrained program is solved numerically by means of a dualization approach.
An application of Chawla's identity to a different scheme for singular problems
Springer Science and Business Media LLC - Tập 30 - Trang 566-568 - 1990
Computation of connection coefficients and measure modifications for orthogonal polynomials
Springer Science and Business Media LLC - Tập 52 - Trang 457-483 - 2011
We observe that polynomial measure modifications for families of univariate orthogonal polynomials imply sparse connection coefficient relations. We therefore propose connecting L
2 expansion coefficients between a polynomial family and a modified family by a sparse transformation. Accuracy and conditioning of the connection and its inverse are explored. The connection and recurren......
Rate of convergence of Local Linearization schemes for random differential equations
Springer Science and Business Media LLC - Tập 49 - Trang 357-373 - 2009
Recently, two Local Linearization (LL) schemes for the numerical integration of random differential equation have been proposed, which differ with respect to the algorithm that is used for the numerical implementation of the Local Linear discretization. However, in contrast with the Local Linear discretization, the order of convergence of the LL schemes have not been studied so far. In this paper,......
Evalquote in simple Fortran: A tutorial on interpreting Lisp
Springer Science and Business Media LLC - Tập 12 - Trang 299-317 - 1972
This paper describes the implementation of a pedagogical version of Evalquote with a set of Fortran subroutines. Their study enables the user to understand the programming machinery needed to interpret Lisp programs; the implementation of the subroutines allows him to run pure Lisp in machines for which only Fortran is available. The approach used in this paper is to define a stack-machine capable......
Non-uniform interpolatory curve subdivision with edge parameters built upon compactly supported fundamental splines
Springer Science and Business Media LLC - Tập 51 - Trang 781-808 - 2011
In this paper we present a family of Non-Uniform Local Interpolatory (NULI) subdivision schemes, derived from compactly supported interpolatory fundamental splines with non-uniform knots (NULIFS). For this spline family, the knot-partition is defined by a sequence of break points and by one additional knot, arbitrarily placed along each knot-interval. The resulting refinement algorithms are linear......
Numerical integration based on bivariate quadratic spline quasi-interpolants on Powell-Sabin partitions
Springer Science and Business Media LLC - Tập 53 - Trang 175-192 - 2012
In this paper we generate and study new cubature formulas based on spline quasi-interpolants in the space of quadratic Powell-Sabin splines on nonuniform triangulations of a polygonal domain in ℝ2. By using a specific refinement of a generic triangulation, optimal convergence orders are obtained for some of these rules. Numerical tests are presented for illustrating the theoretical results.
Two new approaches for solving elliptic obstacle problems using discontinuous Galerkin methods
Springer Science and Business Media LLC - Tập 62 - Trang 89-124 - 2021
The main aim of this article is to present two new ways to solve the elliptic obstacle problem by using discontinuous Galerkin finite element methods. In Gaddam and Gudi (Comput Methods Appl Math 18:223–236, 2018.
https://doi.org/10.1515/cmam-2017-0018......
Tổng số: 2,440
- 1
- 2
- 3
- 4
- 5
- 6
- 10