Výsledky vyhľadávania - "65Y Computer aspects of numerical algorithms"

Bounds on the k-restricted arc connectivity of some bipartite tournaments Autor Balbuena, C., González-Moreno, D., Olsen, M.

“…For k ≥ 2, a strongly connected digraph D is called λk′-connected if it contains a set of arcs W such that D−W contains at least k non-trivial strong…”
Získať plný text

Numerical integration over 2D NURBS-shaped domains with applications to NURBS-enhanced FEM Autor Sevilla, Ruben, Fernández-Méndez, Sonia

“…This paper focuses on the numerical integration of polynomial functions along non-uniform rational B-splines (NURBS) curves and over 2D NURBS-shaped domains,…”
Získať plný text

Least-squares approximation of affine mappings for sweep mesh generation: functional analysis and applications Autor Roca, Xevi, Sarrate, Josep

“…Sweep methods are one of the most robust techniques to generate hexahedral meshes in extrusion volumes. The main issue in sweep algorithms is the projection of…”
Získať plný text

A non-intrusive proper generalized decomposition scheme with application in biomechanics Autor Zou, Xi, Conti, Michele, Díez, Pedro, Auricchio, Ferdinando

“…This is the peer reviewed version of the following article: Zou, X., Conti, M., Diez, P., Auricchio, F. A non-intrusive proper generalized decomposition scheme…”
Získať plný text