Quadratic Interpolatory Splines.
Quadratic spline quasi-interpolants on bounded domains of .
Quadratic splines smoothing the first derivatives
The extremal property of quadratic splines interpolating the first derivatives is proved. Quadratic spline smoothing the given values of the first derivative, depending on the knot weights and smoothing parameter , is then studied. The algorithm for computing appropriate parameters of such splines is given and the dependence on the smoothing parameter is mentioned.
Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time...
Quadrature Formulae for Hp Functions.
Quadrature formulas based on the scaling function
The scaling function corresponding to the Daubechies wavelet with two vanishing moments is used to derive new quadrature formulas. This scaling function has the smallest support among all orthonormal scaling functions with the properties and . So, in this sense, its choice is optimal. Numerical examples are given.
Quadrature Formulas for Oscillatory Integral Transforms.
Quadrature formulas for rational functions.
Quadrature Formulas Obtained by Variable Tranformation.
Quadrature of singular integrands over surfaces.
Quadrature over the sphere.
Quadrature-free quasi-interpolation on the sphere.
Quantitative versions of a result of Hecke in the theory of uniform distribution mod 1
Quartic and biquartic interpolatory splines on simple grid
Quartic smoothing splines generalized
Quartic splines with minimal norms
Quartic X-Splines.
Quasi-Optimal Triangulations for Gradient Nonconforming Interpolates of Piecewise Regular Functions
Anisotropic adaptive methods based on a metric related to the Hessian of the solution are considered. We propose a metric targeted to the minimization of interpolation error gradient for a nonconforming linear finite element approximation of a given piecewise regular function on a polyhedral domain Ω of ℝd, d ≥ 2. We also present an algorithm generating a sequence of asymptotically quasi-optimal meshes relative to such a nonconforming...
Quotienten-Differenzen-Algorithmus: Beweis der Regeln von Rutishauser (Quotient-Difference Algorithm: Proof of Rutishauser's Ru e)