Results 11 to 20 of about 32,375 (100)
Matrix-free weighted quadrature for a computationally efficient isogeometric $k$-method
, 2018 The $k$-method is the isogeometric method based on splines (or NURBS, etc.) with maximum regularity. When implemented following the paradigms of classical finite element methods, the computational resources required by the $k-$method are prohibitive even
Sangalli, Giancarlo, Tani, Mattia
core +1 more source
Polyharmonic homogenization, rough polyharmonic splines and sparse super-localization [PDF]
, 2013 We introduce a new variational method for the numerical homogenization of divergence form elliptic, parabolic and hyperbolic equations with arbitrary rough ($L^\infty$) coefficients.
Berlyand, Leonid +2 more
core +3 more sources
Solving Dynamic Discrete Choice Models Using Smoothing and Sieve Methods [PDF]
, 2019 We propose to combine smoothing, simulations and sieve approximations to solve for either the integrated or expected value function in a general class of dynamic discrete choice (DDC) models.
Kristensen, Dennis +3 more
core +2 more sources
A priori error for unilateral contact problems with Lagrange multiplier and IsoGeometric Analysis [PDF]
, 2018 In this paper, we consider unilateral contact problem without friction between a rigid body and deformable one in the framework of isogeometric analysis.
Antolin, Pablo +2 more
core +2 more sources
Adaptive scattered data fitting by extension of local approximations to hierarchical splines
, 2017 We introduce an adaptive scattered data fitting scheme as extension of local least squares approximations to hierarchical spline spaces. To efficiently deal with non-trivial data configurations, the local solutions are described in terms of (variable ...
Bracco, Cesare +2 more
core +1 more source
IGA-based Multi-Index Stochastic Collocation for random PDEs on arbitrary domains
, 2019 This paper proposes an extension of the Multi-Index Stochastic Collocation (MISC) method for forward uncertainty quantification (UQ) problems in computational domains of shape other than a square or cube, by exploiting isogeometric analysis (IGA ...
Beck, Joakim +2 more
core +1 more source
, 2017 During the last ten years, increasing efforts were made to improve and simplify the process from Computer Aided Design (CAD) modeling to a numerical simulation. It has been shown that the transition from one model to another, i.e.
Bog, Tino +3 more
core +1 more source
Space-time least-squares isogeometric method and efficient solver for parabolic problems
, 2019 In this paper, we propose a space-time least-squares isogeometric method to solve parabolic evolution problems, well suited for high-degree smooth splines in the space-time domain. We focus on the linear solver and its computational efficiency: thanks to
Montardini, Monica +3 more
core +1 more source
, 2018 We present a class of spline finite element methods for time-domain wave propagation which are particularly amenable to explicit time-stepping. The proposed methods utilize a discontinuous Galerkin discretization to enforce continuity of the solution ...
Chan, Jesse, Evans, John A
core +1 more source
, 2017 Numerical simulation of complex optical structures enables their optimization with respect to specific objectives. Often, optimization is done by multiple successive parameter scans, which are time consuming and computationally expensive.
Burger, S. +3 more
core +1 more source