Computation of quadrature rules for integration with respect to refinable functions on assigned nodes
From MaRDI portal
Publication:2513957
DOI10.1016/j.apnum.2014.11.010zbMath1326.65032OpenAlexW2034819234MaRDI QIDQ2513957
Carla Manni, Francesca Pitolli, Francesco Calabrò
Publication date: 29 January 2015
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2014.11.010
Related Items (14)
A fractional spline collocation-Galerkin method for the time-fractional diffusion equation ⋮ Convergent interpolatory quadrature schemes ⋮ Symbolic-numeric computation of orthogonal polynomials and Gaussian quadratures with respect to the cardinal \(B\)-spline ⋮ Matrix Generation in Isogeometric Analysis by Low Rank Tensor Approximation ⋮ Fast formation of isogeometric Galerkin matrices via integration by interpolation and look-up ⋮ Refinable functions, functionals, and iterated function systems ⋮ Fast formation and assembly of finite element matrices with application to isogeometric linear elasticity ⋮ Efficient solution of time-fractional differential equations with a new adaptive multi-term discretization of the generalized Caputo-Dzherbashyan derivative ⋮ Integration by interpolation and look-up for Galerkin-based isogeometric analysis ⋮ Optimal B-spline bases for the numerical solution of fractional differential problems ⋮ Efficient matrix computation for isogeometric discretizations with hierarchical B-splines in any dimension ⋮ Fast formation of isogeometric Galerkin matrices by weighted quadrature ⋮ Efficient assembly based on B-spline tailored quadrature rules for the IgA-SGBEM ⋮ Null rules for the detection of lower regularity of functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple algorithm for obtaining nearly optimal quadrature rules for NURBS-based isogeometric analysis
- Efficient quadrature for NURBS-based isogeometric analysis
- Orthogonal polynomials and Gaussian quadrature for refinable weight functions
- The numerically stable reconstruction of Jacobi matrices from spectral data
- An evaluation of Clenshaw-Curtis quadrature rule for integration w.r.t. singular measures
- One point quadrature rule with cardinal B-spline
- Calculation of the weights of interpolatory quadratures
- A stable Stieltjes technique for computing orthogonal polynomials and Jacobi matrices associated with a class of singular measures
- On generating orthogonal polynomials for discrete measures
- Gauss quadrature for refineable weight functions
- Reduced Bézier element quadrature rules for quadratic and cubic splines in isogeometric analysis
- Composite quadrature formulae for the approximation of wavelet coefficients of piecewise smooth and singular functions
- Integration by interpolation and look-up for Galerkin-based isogeometric analysis
- Interpolation through an iterative scheme
- Stable high-order quadrature rules with equidistant points
- Some Remarks on Quadrature Formulas for Refinable Functions and Wavelets
- Subdivision schemes in geometric modelling
- Orthogonal polynomials for refinable linear functionals
- Algorithm 655
- Two-Scale Difference Equations. I. Existence and Global Regularity of Solutions
- Ten Lectures on Wavelets
- On Refinement Equations Determined by Pólya Frequency Sequences
- Quadrature Formulae and Asymptotic Error Expansions for Wavelet Approximations of Smooth Functions
- Isogeometric Analysis
- Using the Refinement Equation for Evaluating Integrals of Wavelets
- Fractional Splines and Wavelets
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Solving confluent Vandermonde systems of Hermite type
- A practical guide to splines.
This page was built for publication: Computation of quadrature rules for integration with respect to refinable functions on assigned nodes
