相关论文: B\'{e}zier $\bar{B}$ Projection

An isogeometric boundary element method for problems in elasticity is presented, which is based on an independent approximation for the geometry, traction and displacement field. This enables a flexible choice of refinement strategies,…

The projected subgradient method for constrained minimization repeatedly interlaces subgradient steps for the objective function with projections onto the feasible region, which is the intersection of closed and convex constraints sets, to…

This work presents a computational method for the design of architected truss lattice materials where each strut can be made of one of a set of available materials. We design the lattices to extremize effective properties. As customary in…

We consider a dynamical elasto-plasticity system with Kelvin--Voigt viscosity and linear kinematic hardening of Melan--Prager type. The model is formulated in a variational framework in which a constraint set for the stress evolves in time…

Compactly supported shearlets have been studied in both theory and applications. In this paper, we construct symmetric compactly supported shearlet systems based on pseudo splines of type II. Specially, using B-splines, we construct…

This paper proposes an isogeometric boundary element method (IGBEM) to solve the electromagnetic scattering problems for three-dimensional doubly-periodic multi-layered structures. The main concerns are the constructions of (i) an open…

A virtual element discretisation for the numerical approximation of the three-field formulation of linear poroelasticity introduced in [R. Oyarz\'ua and R. Ruiz-Baier, Locking-free finite element methods for poroelasticity, SIAM J. Numer.…

In this paper, we propose a tightly-coupled SLAM system fused with RGB, Depth, IMU and structured plane information. Traditional sparse points based SLAM systems always maintain a mass of map points to model the environment. Huge number of…

Volumetric spline parameterization and computational efficiency are two main challenges in isogeometric analysis (IGA). To tackle this problem, we propose a framework of computation reuse in IGA on a set of three-dimensional models with…

This paper proposes a binarization scheme for vectors of high dimension based on the recent concept of anti-sparse coding, and shows its excellent performance for approximate nearest neighbor search. Unlike other binarization schemes, this…

We present a unified framework for 3D geometric abstraction using a single continuous 4D wire, parameterized as a B-spline with spatial coordinates and variable width $(x,y,z,w)$. Existing approaches typically represent shapes as…

Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…

A key problem in multiobjective linear programming is to find the set of all efficient extreme points in objective space. In this paper we introduce oriented projective geometry as an efficient and effective framework for solving this…

The adjoint method allows efficient calculation of the gradient with respect to the design variables of a topology optimization problem. This method is almost exclusively used in combination with traditional Finite-Element-Analysis, whereas…

This paper introduces a new local plastic correction algorithm that is aimed at accelerating elasto-plastic finite element (FE) simulations for structural problems exhibiting localised plasticity (around e.g. notches, geometrical defects).…

The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both…

We consider the geometric optics problem of finding a system of two reflectors that transform a spherical wavefront into a beam of parallel rays with prescribed intensity distribution. Using techniques from optimal transportation theory, it…

With a Bayesian approach, the linear optics correction algorithm for storage rings is revisited. Starting from the Bayes' theorem, a complete linear optics model is simplified as "likelihood functions" and "prior probability distributions".…

The Bezier simplex fitting is a novel data modeling technique which exploits geometric structures of data to approximate the Pareto front of multi-objective optimization problems. There are two fitting methods based on different sampling…

This article focuses on numerical efficiency of projection algorithms for solving linear optimization problems. The theoretical foundation for this approach is provided by the basic result that bounded finite dimensional linear optimization…