Search results for "Mathematics::Numerical Analysis"
showing 10 items of 57 documents
Blow-up collocation solutions of nonlinear homogeneous Volterra integral equations
2011
In this paper, collocation methods are used for detecting blow-up solutions of nonlinear homogeneous Volterra-Hammerstein integral equations. To do this, we introduce the concept of "blow-up collocation solution" and analyze numerically some blow-up time estimates using collocation methods in particular examples where previous results about existence and uniqueness can be applied. Finally, we discuss the relationships between necessary conditions for blow-up of collocation solutions and exact solutions.
Maximale Konvergenzordnung bei der numerischen Lösung von Anfangswertproblemen mit Splines
1982
In [10] a general procedureV is presented to obtain spline approximations by collocation for the solutions of initial value problems for first order ordinary differential equations. In this paper the attainable order of convergence with respect to the maximum norm is characterized in dependence of the parameters involved inV; in particular the appropriate choice of the collocation points is considered.
A mixed finite element method for the heat flow problem
1981
A semidiscrete finite element scheme for the approximation of the spatial temperature change field is presented. The method yields a better order of convergence than the conventional use of linear elements.
Entropy dissipation of moving mesh adaptation
2012
Non-uniform grids and mesh adaptation have been a growing part of numerical simulation over the past years. It has been experimentally noted that mesh adaptation leads not only to locally improved solution but also to numerical stability of the underlying method. There have been though only few results on the mathematical analysis of these schemes due to the lack of proper tools that incorporate both the time evolution and the mesh adaptation step of the overall algorithm. In this paper we provide a method to perform the analysis of the mesh adaptation method, including both the mesh reconstruction and evolution of the solution. We moreover employ this method to extract sufficient condition…
An abstract inf-sup problem inspired by limit analysis in perfect plasticity and related applications
2021
This paper is concerned with an abstract inf-sup problem generated by a bilinear Lagrangian and convex constraints. We study the conditions that guarantee no gap between the inf-sup and related sup-inf problems. The key assumption introduced in the paper generalizes the well-known Babuška–Brezzi condition. It is based on an inf-sup condition defined for convex cones in function spaces. We also apply a regularization method convenient for solving the inf-sup problem and derive a computable majorant of the critical (inf-sup) value, which can be used in a posteriori error analysis of numerical results. Results obtained for the abstract problem are applied to continuum mechanics. In particular…
B-Deformable Superquadrics for 3D Reconstruction
1995
We propose a new model for 3D representation and reconstruction. It is based on deformable superquadrics and parametric B-Splines. The 3D object deformation method uses B-Splines, instead of a Finite Element Method (FEM). This new model exhibits advantages of B-Splines It is significantly faster than deformable superquadrics without loss of generality (no assumption is made on object shapes,).
Error analysis for a special X-spline
1979
Clenshaw and Negus [1] defined the cubic X-spline, and they applied it to an interpolation problem. In the present paper, for the same interpolation problem, an interpolating splinew is considered by combining two specialX-splines. The construction ofw is such that the computational labour for its determination, in the case of piecewise equally spaced knots, is less than that of the conventional cubic splines c . A complete error analysis ofw is done. One of the main results is that, in the case of piecewise equally spaced knots,w ands c have essentially the same error estimates.
Fast MATLAB assembly of FEM matrices in 2D and 3D: Edge elements
2014
We propose an effective and flexible way to assemble finite element stiffness and mass matrices in MATLAB. We apply this for problems discretized by edge finite elements. Typical edge finite elements are Raviart-Thomas elements used in discretizations of H(div) spaces and Nedelec elements in discretizations of H(curl) spaces. We explain vectorization ideas and comment on a freely available MATLAB code which is fast and scalable with respect to time.
Periodic Discrete Splines
2014
Periodic discrete splines with different periods and spans were introduced in Sect. 3.4. In this chapter, we discuss families of periodic discrete splines, whose periods and spans are powers of 2. As in the polynomial splines case, the Zak transform is extensively employed. It results in the Discrete Spline Harmonic Analysis (DSHA). Utilization of the Fast Fourier transform (FFT) enables us to implement all the computations in a fast explicit way.
Dimension bounds in monotonicity methods for the Helmholtz equation
2019
The article [B. Harrach, V. Pohjola, and M. Salo, Anal. PDE] established a monotonicity inequality for the Helmholtz equation and presented applications to shape detection and local uniqueness in inverse boundary problems. The monotonicity inequality states that if two scattering coefficients satisfy $q_1 \leq q_2$, then the corresponding Neumann-to-Dirichlet operators satisfy $\Lambda(q_1) \leq \Lambda(q_2)$ up to a finite-dimensional subspace. Here we improve the bounds for the dimension of this space. In particular, if $q_1$ and $q_2$ have the same number of positive Neumann eigenvalues, then the finite-dimensional space is trivial. peerReviewed