EuDML | Browse

We analyze a numerical model for the Signorini unilateral contact, based on the mortar method, in the quadratic finite element context. The mortar frame enables one to use non-matching grids and brings facilities in the mesh generation of different components of a complex system. The convergence rates we state here are similar to those already obtained for the Signorini problem when discretized on conforming meshes. The matching for the unilateral contact driven by mortars preserves then the proper...

Quadratic Interpolatory Splines.

R.S. Varga, W.J. Kammerer, G.W. Reddien (1974)

Numerische Mathematik

Quadratic regular reversal maps.

Solis, Francisco J., Jódar, Lucas (2004)

Discrete Dynamics in Nature and Society

Quadratic spline quasi-interpolants on bounded domains of $ℝ^{d}, d = 1, 2, 3$ .

Sablonnière, P. (2003)

Rendiconti del Seminario Matematico

Quadratic splines smoothing the first derivatives

Jiří Kobza (1992)

Applications of Mathematics

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 $w_{i}$ 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

Mirzoev, Tigran, Vassilev, Tzvetalin (2010)

Serdica Journal of Computing

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...

Quadratically constrained least squares and quadratic problems.

Gene H. Golub, Urs von Matt (1991)

Numerische Mathematik

Quadrature approximation of one singular integral operator.

Sanikidze, J. (2001)

Computational Methods in Applied Mathematics

Quadrature Formulae for Hp Functions.

Donald J. Newman (1979)

Mathematische Zeitschrift

Quadrature formulas based on the scaling function

Václav Finěk (2005)

Applications of Mathematics

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 $M_{2} = M_{1}^{2}$ and $M_{0} = 1$ . So, in this sense, its choice is optimal. Numerical examples are given.

Currently displaying 1 – 20 of 61

Page 1 Next

Displaying 1 – 20 of 61

QMR: a quasi-minimal residual method for non-Hermitian linear systems.

QR Factorization of Toeplitz Matrices.

QR factorizations using a restricted set of rotations.

QR in two dimensions.

Quadratic and homogeneous Hamilton-Poisson systems on $A_{3, 6, - 1}^{*}$ .

Quadratic convergence bounds of scaled iterates by the serial Jacobi methods for indefinite Hermitian matrices.

Quadratic finite elements with non-matching grids for the unilateral boundary contact