isogeometric boundary element analysis using unstructured t splines we couple collocated isogeometric boundary element methods and unstructured analysis suitable t spline surfaces for linear elastostatic problems we extend the definition of analysis suitable t splines to encompass unstructured control grids unstructured meshes and develop basis functions which are smooth rational polynomials defined in terms of the bezier extraction framework and which pass standard patch tests we then develop a collocation procedure which correctly accounts for sharp edges and corners extraordinary points and t junctions this approach is applied to several three dimensional problems including a real world t spline model of a propeller we believe this work clearly illustrates the power of combining new analysis suitable computer aided design technologies with established analysis methodologies in this case the boundary element method

eigenschemes and the jordan canonical form abstract we study the eigenscheme of a matrix which encodes information about the eigenvectors and generalized eigenvectors of a square matrix the two main results in this paper are a decomposition of the eigenscheme of a matrix into primary components and the fact that this decomposition encodes the numeric data of the jordan canonical form of the matrix we also describe how the eigenscheme can be interpreted as the zero locus of a global section of the tangent bundle on projective space this interpretation allows one to see eigenvectors and generalized eigenvectors of matrices from an alternative viewpoint

parallel spectral element solution of the stokes problem abstract in this paper we present a high efficiency medium grained parallel spectral element method for numerical solution of the stokes problem in general domains the method is based upon naturally concurrent uzawa and jacobi preconditioned conjugate gradient iterative methods geometry based data parallel distribution of work amongst processors nearest neighbor sparsity and high order substructuring for minimum communication general locally structured globally unstructured parallel constructs and efficient embedding of vector reduction operations for inner product and norm calculation an analysis is given for the computational complexity of the algorithm on a native medium grained parallel processor and the potential communication superiority of high order discretizations is described lastly the method is implemented on the fast intel vector hypercube and the performance of this algorithm architecture coupling is evaluated in a technical and economic framework that reflects the true advantages of parallel solution of partial differential equations

high order finite elements for shells in this article the p version finite element method is applied to thin walled structures two different hierarchic element formulations are compared a shell approach as well as a shell like solid formulation both approaches are compared for linear elastic and elastoplastic problems special emphasis is placed on the efficiency as well as on determining the area of application for both formulations

the solution of elastostatic and elastodynamic problems with chebyshev spectral finite elements chebyshev spectral finite elements are applied to the solution of elastostatic and elastodynamic problems in two dimensions the accuracy of the spectral approach is judged by examining the dispersion of the solutions it is shown that the spectral approach can achieve nearly zero dispersion for a wide range of spatial and temporal discretizations even coarse mesh solutions using the explicit lumped capacitance approach demonstrate exceptional accuracy a brief description of the development of the chebyshev spectral elements is included

a point collocation method based on reproducing kernel approximations a reproducing kernel particle method with built in multiresolution features in a very attractive meshfree method for numerical solution of partial differential equations the design and implementation of a galerkin based reproducing kernel particle method however faces several challenges such as the issue of nodal volumes and accurate and efficient implementation of boundary conditions in this paper we present a point collocation method based on reproducing kernel approximations we show that in a point collocation approach the assignment of nodal volumes and implementation of boundary conditions are not critical issues and points can be sprinkled randomly making the point collocation method a true meshless approach the point collocation method based on reproducing kernel approximations however requires the calculation of higher order derivatives that would typically not be required in a galerkin method a correction function and reproducing conditions that enable consistency of the point collocation method are derived the point collocation method is shown to be accurate for several one and two dimensional problems and the convergence rate of the point collocation method is addressed copyright 2000 john wiley sons ltd

an ultra weak finite element method as an alternative to a monte carlo method for an elasto plastic problem with noise an efficient method for obtaining numerical solutions of an elasto plastic oscillator with noise is considered since monte carlo simulations for the underlying stochastic process are too slow as an alternative approximate solutions of the partial differential equation defining the invariant measure of the process are studied the regularity of the solution of that partial differential equation is not sufficient to employ a standard finite element method to overcome the difficulty an ultra weak finite element method has been developed and successfully implemented

the dpg method for the stokes problem we discuss well posedness and convergence theory for the dpg method applied to a general system of linear partial differential equations pdes and specialize the results to the classical stokes problem the stokes problem is an iconic troublemaker for standard bubnov galerkin methods if discretizations are not carefully designed they may exhibit non convergence or locking by contrast dpg does not require us to treat the stokes problem in any special manner we illustrate and confirm our theoretical convergence estimates with numerical experiments

explicit time integration algorithms for structural dynamics with optimal numerical dissipation abstract a new predictor corrector explicit time integration algorithm is presented for solving structural dynamics problems the basis of the algorithm is the implicit generalized method developed by the authors like its implicit parent the explicit generalized method is a one parameter family of algorithms in which the parameter defines the high frequency numerical dissipation for a given value of high frequency dissipation the explicit generalized method minimizes low frequency dissipation the algorithm can be utilized effectively for structural dynamics calculations in which numerical dissipation is needed to reduce spurious oscillations parameter values are given that enable physical damping to be treated explicitly while maintaining second order accuracy without the need for an expensive second corrector pass

isogeometric spline forests in this paper we present isogeometric spline forests an isogeometric spline forest is a hierarchical spline representation capable of representing surfaces or volumes of arbitrarily complex geometry and topological genus spline forests can accomodate arbitrary degree and smoothness in the underlying hierarchical basis as well as non uniform knot interval configurations we describe adaptive h refinement and coarsening algorithms for isogeometric spline forests and develop a bezier extraction framework which provides a simple and efficient single level finite element description of the complex multi level unstructured hierarchical spline basis we then demonstrate the potential of spline forests as a basis for analysis in the context of transient advection diffusion problems where fully integrated adaptivity is demonstrated for the first time in an isogeometric simulation in all cases the adaptive process remains local even in the case of moving fronts and preserves exact geometry at the coarsest level of the discretization the accuracy and robustness of the approach is demonstrated in all cases

the performance of the collocation and galerkin methods with hermite bi cubics this paper presents a study of the performance of the collocation and galerkin methods using hermite bi cubic basis functions it is a sequel to the studies of houstis et al 6 and weiser et al

maximum principle and convergence analysis for the meshfree point collocation method the discrete laplacian operator is considered in the sense of the meshfree point collocation method which will be called the strong meshfree laplacian operator to define the strong meshfree laplacian operator we use the fast version of the generalized moving least square approximation which can calculate the approximated derivatives of shape functions some types of the locally layered node distribution are defined in this paper and two specific domains are constructed onto which we can distribute locally layered nodes at such nodes the discrete maximum principle can be shown to hold through the representation formula for the strong meshfree laplacian operator the discrete maximum principle together with the reproducing property of the meshfree approximations results in an a priori estimate for the strong meshfree laplacian operator in the nodal solution space furthermore the a priori estimate we have obtained guarantees the existence and the uniqueness of the numerical solution and plays a central role in achieving converged results for the poisson problem with dirichlet boundary conditions in the nodal solution space the order of convergence of the nodal solutions can be raised up to o h2 at the proposed type of nodes in specific domains for generally shaped domains immersed in the previously mentioned domains we can obtain the first order convergence result of o h

an unfitted hp adaptive finite element method based on hierarchical b splines for interface problems of complex geometry generating finite element discretizations with direct interface parameterizations constitutes a considerable computational expense in case of complex interface geometries the paper at hand introduces a b spline finite element method which circumvents parameterization of interfaces and offers fast and easy meshing irrespective of the geometric complexity involved its core idea is the adaptive approximation of discontinuities by hierarchical grid refinement which adds several levels of local basis functions in the close vicinity of interfaces but unfitted to their exact location so that a simple regular grid of knot span elements can be maintained numerical experiments show that an hp refinement strategy which simultaneously increases the polynomial degree of the b spline basis and the levels of refinement around interfaces achieves exponential rates of convergence despite the presence of discontinuities it is also demonstrated that the hierarchical b spline fem can be used to transfer the recently introduced finite cell concept to geometrically nonlinear problems its computational performance imposition of unfitted boundary conditions and fast hierarchical grid generation are illustrated for a set of benchmark problems in one two and three dimensions and the advantages of the regular grid approach for complex geometries are demonstrated by the geometrically nonlinear simulation of a voxel based foam composite

analysis of the dpg method for the poisson equation we give an error analysis of the recently developed dpg method applied to solve the poisson equation and a convection diffusion problem we prove that the method is quasioptimal error estimates in terms of both the mesh size h and the polynomial degree p for various element shapes can be derived from our results results of extensive numerical experiments are also presented

on the asymptotic convergence of collocation methods we prove quasioptimal and optimal order estimates in various sobolev norms for the approximation of linear strongly elliptic pseudodifferential equations in one independent variable by the method of nodal collocation by odd degree polynomial splines the analysis pertains in particular to many of the boundary element methods used for numerical computation in engineering applications equations to which the analysis is applied include fredholm integral equations of the second kind certain first kind fredholm equations singular integral equations involving cauchy kernels a variety of integro differential equations and two point boundary value problems for ordinary differential equations the error analysis is based on an equivalence which we establish between the collocation methods and certain nonstandard galerkin methods we compare the collocation method with a standard galerkin method using splines of the same degree showing that the galerkin method is quasioptimal in a sobolev space of lower index and furnishes optimal order approximation for a range of sobolev indices containing and extending below that for the collocation method and so the standard galerkin method achieves higher rates of convergence

on condition numbers in hp fem with gauss lobatto based shape functions sharp bounds on the condition number of stiffness matrices arising in hp spectral discretizations for two dimensional problems elliptic problems are given two types of shape functions that are based on lagrange interpolation polynomials in the gauss lobatto points are considered these shape functions result in condition numbers o p and o p ln p for the condensed stiffness matrices where p is the polynomial degree employed locally refined meshes are analyzed for the discretization of dirichlet problems on meshes that are refined geometrically toward singularities the conditioning of the stiffness matrix is shown to be independent of the number of layers of geometric refinement

the hp d adaptive finite cell method for geometrically nonlinear problems of solid mechanics summary the finite cell method fcm combines the fictitious domain approach with the p version of the finite element method and adaptive integration for problems of linear elasticity it offers high convergence rates and simple mesh generation irrespective of the geometric complexity involved this article presents the integration of the fcm into the framework of nonlinear finite element technology however the penalty parameter of the fictitious domain is restricted to a few orders of magnitude in order to maintain local uniqueness of the deformation map as a consequence of the weak penalization nonlinear strain measures provoke excessive stress oscillations in the cells cut by geometric boundaries leading to a low algebraic rate of convergence therefore the fcm approach is complemented by a local overlay of linear hierarchical basis functions in the sense of the hp d method which synergetically uses the h adaptivity of the integration scheme numerical experiments show that the hp d overlay effectively reduces oscillations and permits stronger penalization of the fictitious domain by stabilizing the deformation map the hp d adaptive fcm is thus able to restore high convergence rates for the geometrically nonlinear case while preserving the easy meshing property of the original fcm accuracy and performance of the present scheme are demonstrated by several benchmark problems in one two and three dimensions and the nonlinear simulation of a complex foam sample copyright 2011 john wiley sons ltd

a collocated c0 finite element method reduced quadrature perspective cost comparison with standard finite elements and explicit structural dynamics summary we demonstrate the potential of collocation methods for efficient higher order analysis on standard nodal finite element meshes we focus on a collocation method that is variationally consistent and geometrically flexible converges optimally embraces concepts of reduced quadrature and leads to symmetric stiffness and diagonal consistent mass matrices at the same time it minimizes the evaluation cost per quadrature point thus reducing formation and assembly effort significantly with respect to standard galerkin finite element methods we provide a detailed review of all components of the technology in the context of elastodynamics that is weighted residual formulation nodal basis functions on gauss lobatto quadrature points and symmetrization by averaging with the ultra weak formulation we quantify potential gains by comparing the computational efficiency of collocated and standard finite elements in terms of basic operation counts and timings our results show that collocation is significantly less expensive for problems dominated by the formation and assembly effort such as higher order elastostatic analysis furthermore we illustrate the potential of collocation for efficient higher order explicit dynamics throughout this work we advocate a straightforward implementation based on simple modifications of standard finite element codes we also point out the close connection to spectral element methods where many of the key ideas are already established copyright 2014 john wiley sons ltd

analytical and computational assessment of locking in the hp finite element method locking is the phenomenon by which the numerical approximation of parameter dependent problems deteriorates for values of the parameter close to a limiting value in this paper we give a definition of locking and develop precise computable and analytic ways to quantify it using the example of nearly incompressible elasticity we show by means of computational and theoretical results the difference between the h version and php version in combatting locking our results establish the superiority of high order elements both h p and hp when the standard variational form is used we also discuss other issues such as curved elements mixed methods and locking phenomena for problems over anisotropic materials and over thin domains

fully discrete hp finite elements fast quadrature a fully discrete hp finite element method fem is presented it combines the features of the standard hp fem conforming galerkin formulation variable order quadrature schemes geometric meshes static condensation and of the spectral element method special shape functions and spectral quadrature techniques the speed up relative to standard hp elements is analyzed in detail both theoretically and computationally

the spectral element method for elastic wave equations application to 2 d and 3 d seismic problems a spectral element method for the approximate solution of linear elastodynamic equations set in a weak form is shown to provide an efficient tool for simulating elastic wave propagation in realistic geological structures in two and three dimensional geometries the computational domain is discretized into quadrangles or hexahedra defined with respect to a reference unit domain by an invertible local mapping inside each reference element the numerical integration is based on the tensor product of a gauss lobatto legendre 1 d quadrature and the solution is expanded onto a discrete polynomial basis using lagrange interpolants as a result the mass matrix is always diagonal which drastically reduces the computational cost and allows an efficient parallel implementation absorbing boundary conditions are introduced in variational form to simulate unbounded physical domains the time discretization is based on an energy momentum conserving scheme that can be put into a classical explicit implicit predictor multicorrector format long term energy conservation and stability properties are illustrated as well as the efficiency of the absorbing conditions the accuracy of the method is shown by comparing the spectral element results to numerical solutions of some classical two dimensional problems obtained by other methods the potentiality of the method is then illustrated by studying a simple three dimensional model very accurate modelling of rayleigh wave propagation and surface diffraction is obtained at a low computational cost the method is shown to provide an efficient tool to study the diffraction of elastic waves and the large amplification of ground motion caused by three dimensional surface topographies copyright 1999 john wiley sons ltd

geometric modeling isogeometric analysis and the finite cell method the advent of isogeometric analysis iga using the same basis functions for design and analysis constitutes a milestone in the unification of geometric modeling and numerical simulation however an important class of geometric models based on the csg constructive solid geometry concept such as trimmed nurbs surfaces do not fully support the isogeometric paradigm since basis functions do not explicitly represent the boundary the finite cell method fcm is a high order fictitious domain method which offers simple meshing of potentially complex domains into a structured grid of cuboid cells while still achieving exponential rates of convergence for smooth problems in the present paper we first discuss the possibility to directly couple the finite cell method to csg without any necessity for meshing the three dimensional domain and then explore a combination of the best of the two approaches iga and fcm closely following ideas of the recently introduced shell fcm the resulting finite cell extension to isogeometric analysis achieves a truly straightforward transfer of a trimmed nurbs surface into an analysis suitable nurbs basis while benefiting from the favorable properties of the high order and high continuity basis functions accuracy and efficiency of the new approach are demonstrated by a numerical benchmark and its versatility is outlined by the analysis of different trimmed design variants of a brake disk

a spectral element method for fluid dynamics laminar flow in a channel expansion a spectral element method that combines the generality of the finite element method with the accuracy of spectral techniques is proposed for the numerical solution of the incompressible navier stokes equations in the spectral element discretization the computational domain is broken into a series of elements and the velocity in each element is represented as a high order lagrangian interpolant through chebyshev collocation points the hyperbolic piece of the governing equations is then treated with an explicit collocation scheme while the pressure and viscous contributions are treated implicitly with a projection operator derived from a variational principle the implementation of the technique is demonstrated on a one dimensional inflow outflow advection diffusion equation and the method is then applied to laminar two dimensional separated flow in a channel expansion comparisons are made with experiment and previous numerical work

asymptotic analysis for penalty and barrier methods in convex and linear programming we consider a wide class of penalty and barrier methods for convex programming which includes a number of specific functions proposed in the literature we provide a systematic way to generate penalty and barrier functions in this class and we analyze the existence of primal and dual optimal paths generated by these penalty methods as well as their convergence to the primal and dual optimal sets for linear programming we prove that these optimal paths converge to single points

asymptotic analysis of congested communication networks this paper is devoted to the mathematical study of a routing problem in telecommunication networks when the cost function is the average delay of communications we establish asymptotic expansions for the value function and solutions in the vicinity of a congested nominal problem the study is strongly related to the one of a partial inverse barrier method for linear programming

optimization problems with perturbations a guided tour this paper presents an overview of some recent and significant progress in the theory of optimization problems with perturbations we put the emphasis on methods based on upper and lower estimates of the objective function of the perturbed problems these methods allow one to compute expansions of the optimal value function and approximate optimal solutions in situations where the set of lagrange multipliers is not a singleton may be unbounded or is even empty we give rather complete results for nonlinear programming problems and describe some extensions of the method to more general problems we illustrate the results by computing the equilibrium position of a chain that is almost vertical or horizontal