Open Access. Powered by Scholars. Published by Universities.®

Numerical Analysis and Computation Commons™

Open Access. Powered by Scholars. Published by Universities.®

Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 211 - 240 of 251

Full-Text Articles in Numerical Analysis and Computation

Variational Analysis In Semi-Infinite And Infinite Programming, Ii: Necessary Optimality Conditions, M J. Cánovas, M A. Lopez, Boris S. Mordukhovich, J Parra Jul 2009

Variational Analysis In Semi-Infinite And Infinite Programming, Ii: Necessary Optimality Conditions, M J. Cánovas, M A. Lopez, Boris S. Mordukhovich, J Parra

Mathematics Research Reports

This paper concerns applications of advanced techniques of variational analysis and generalized differentiation to problems of semi-infinite and infinite programming with feasible solution sets defined by parameterized systems of infinitely many linear inequalities of the type intensively studied in the preceding development [5] from our viewpoint of robust Lipschitzian stability. We present meaningful interpretations and practical examples of such models. The main results establish necessary optimality conditions for a broad class of semi-infinite and infinite programs, where objectives are generally described by nonsmooth and nonconvex functions on Banach spaces and where infinite constraint inequality systems are indexed by arbitrary sets. …

Go to article

Variational Analysis In Semi-Infinite And Infinite Programming, I: Stability Of Linear Inequality Systems Of Feasible Solutions, M J. Cánovas, M A. Lopez, Boris S. Mordukhovich, J Parra Jun 2009

Variational Analysis In Semi-Infinite And Infinite Programming, I: Stability Of Linear Inequality Systems Of Feasible Solutions, M J. Cánovas, M A. Lopez, Boris S. Mordukhovich, J Parra

Mathematics Research Reports

This paper concerns applications of advanced techniques of variational analysis and generalized differentiation to parametric problems of semi-infinite and infinite programming, where decision variables run over finite-dimensional and infinite-dimensional spaces, respectively. Part I is primarily devoted to the study of robust Lipschitzian stability of feasible solutions maps for such problems described by parameterized systems of infinitely many linear inequalities in Banach spaces of decision variables indexed by an arbitrary set T. The parameter space of admissible perturbations under consideration is formed by all bounded functions on T equipped with the standard supremum norm. Unless the index set is finite, this …

Go to article

Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang Jun 2009

Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang

Applications and Applied Mathematics: An International Journal (AAM)

Two new families of nonlinear 3-point subdivision schemes for curve design are introduced. The first family is ternary interpolatory and the second family is binary approximation. All these new schemes are circular-invariant, meaning that new vertices are generated from local circles formed by three consecutive old vertices. As consequences of the nonlinear schemes, two new families of linear subdivision schemes for curve design are established. The 3-point linear binary schemes, which are corner-cutting depending on the choices of the tension parameter, are natural extensions of the Lane-Riesenfeld schemes. The four families of both nonlinear and linear subdivision schemes are implemented …

Go to article

Fractional Calculus: Definitions And Applications, Joseph M. Kimeu Apr 2009

Fractional Calculus: Definitions And Applications, Joseph M. Kimeu

Masters Theses & Specialist Projects

No abstract provided.

Go to article

Polynomial Extension Operators. Part Ii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl Jan 2009

Polynomial Extension Operators. Part Ii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl

Mathematics and Statistics Faculty Publications and Presentations

Consider the tangential trace of a vector polynomial on the surface of a tetrahedron. We construct an extension operator that extends such a trace function into a polynomial on the tetrahedron. This operator can be continuously extended to the trace space of H(curl ). Furthermore, it satisfies a commutativity property with an extension operator we constructed in Part I of this series. Such extensions are a fundamental ingredient of high order finite element analysis.

Go to article

On A-Ary Subdivision For Curve Design Ii. 3-Point And 5-Point Interpolatory Schemes, Jian-Ao Lian Dec 2008

On A-Ary Subdivision For Curve Design Ii. 3-Point And 5-Point Interpolatory Schemes, Jian-Ao Lian

Applications and Applied Mathematics: An International Journal (AAM)

The a-ary 3-point and 5-point interpolatery subdivision schemes for curve design are introduced for arbitrary odd integer a greater than or equal to 3. These new schemes further extend the family of the classical 4- and 6-point interpolatory schemes.

Go to article

Uniform Uncertainty Principle And Signal Recovery Via Regularized Orthogonal Matching Pursuit, Deanna Needell, Roman Vershynin Jun 2008

Uniform Uncertainty Principle And Signal Recovery Via Regularized Orthogonal Matching Pursuit, Deanna Needell, Roman Vershynin

CMC Faculty Publications and Research

This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements—L1-minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of Orthogonal Matching Pursuit (ROMP) which has advantages of both approaches: the speed and transparency of OMP and the strong uniform guarantees of L1-minimization. Our algorithm, ROMP, reconstructs a sparse signal in a number of iterations linear in the sparsity, and the reconstruction is exact provided the linear measurements satisfy the uniform uncertainty principle.

Go to article

On A-Ary Subdivision For Curve Design: I. 4-Point And 6-Point Interpolatory Schemes, Jian-Ao Lian Jun 2008

On A-Ary Subdivision For Curve Design: I. 4-Point And 6-Point Interpolatory Schemes, Jian-Ao Lian

Applications and Applied Mathematics: An International Journal (AAM)

The classical binary 4-point and 6-point interpolatery subdivision schemes are generalized to a-ary setting for any integer a greater than or equal to 3. These new a-ary subdivision schemes for curve design are derived easily from their corresponding two-scale scaling functions, a notion from the context of wavelets.

Go to article

Signed Decomposition Of Fully Fuzzy Linear Systems, Tofigh Allahviranloo, Nasser Mikaeilvand, Narsis A. Kiani, Rasol M. Shabestari Jun 2008

Signed Decomposition Of Fully Fuzzy Linear Systems, Tofigh Allahviranloo, Nasser Mikaeilvand, Narsis A. Kiani, Rasol M. Shabestari

Applications and Applied Mathematics: An International Journal (AAM)

System of linear equations is applied for solving many problems in various areas of applied sciences. Fuzzy methods constitute an important mathematical and computational tool for modeling real-world systems with uncertainties of parameters. In this paper, we discuss about fully fuzzy linear systems in the form AX = b (FFLS). A novel method for finding the non-zero fuzzy solutions of these systems is proposed. We suppose that all elements of coefficient matrix A are positive and we employ parametric form linear system. Finally, Numerical examples are presented to illustrate this approach and its results are compared with other methods.

Go to article

Methods Of Assessing And Ranking Probable Sources Of Error, Nataniel Greene May 2008

Methods Of Assessing And Ranking Probable Sources Of Error, Nataniel Greene

Publications and Research

A classical method for ranking n potential events as sources of error is Bayes' theorem. However, a ranking based on Bayes' theorem lacks a fundamental symmetry: the ranking in terms of blame for error will not be the reverse of the ranking in terms of credit for lack of error. While this is not a flaw in Bayes' theorem, it does lead one to inquire whether there are related methods which have such symmetry. Related methods explored here include the logical version of Bayes' theorem based on probabilities of conditionals, probabilities of biconditionals, and ratios or differences of credit to …

Go to article

A Wavelet-Based Method For Overcoming The Gibbs Phenomenon, Nataniel Greene Mar 2008

A Wavelet-Based Method For Overcoming The Gibbs Phenomenon, Nataniel Greene

Publications and Research

The Gibbs phenomenon refers to the lack of uniform convergence which occurs in many orthogonal basis approximations to piecewise smooth functions. This lack of uniform convergence manifests itself in spurious oscillations near the points of discontinuity and a low order of convergence away from the discontinuities. Here we describe a numerical procedure for overcoming the Gibbs phenomenon called the inverse wavelet reconstruction method. The method takes the Fourier coefficients of an oscillatory partial sum and uses them to construct the wavelet coefficients of a non-oscillatory wavelet series.

Go to article

An Overview Of Conditionals And Biconditionals In Probability, Nataniel Greene Mar 2008

An Overview Of Conditionals And Biconditionals In Probability, Nataniel Greene

Publications and Research

Conditional and biconditional statements are a standard part of symbolic logic but they have only recently begun to be explored in probability for applications in artificial intelligence. Here we give a brief overview of the major theorems involved and illustrate them using two standard model problems from conditional probability.

Go to article

Fourier Series Of Orthogonal Polynomials, Nataniel Greene Feb 2008

Fourier Series Of Orthogonal Polynomials, Nataniel Greene

Publications and Research

Explicit formulas for the Fourier coefficients of the Legendre polynomials can be found in the Bateman Manuscript Project. However, similar formulas for more general classes of orthogonal polynomials do not appear to have been worked out. Here we derive explicit formulas for the Fourier series of Gegenbauer, Jacobi, Laguerre and Hermite polynomials.

Go to article

Formulas For The Fourier Series Of Orthogonal Polynomials In Terms Of Special Functions, Nataniel Greene Jan 2008

Formulas For The Fourier Series Of Orthogonal Polynomials In Terms Of Special Functions, Nataniel Greene

Publications and Research

An explicit formula for the Fourier coefficient of the Legendre polynomials can be found in the Bateman Manuscript Project. However, formulas for more general classes of orthogonal polynomials do not appear to have been worked out. Here we derive explicit formulas for the Fourier series of Gegenbauer, Jacobi, Laguerre and Hermite polynomials. The methods described here apply in principle to a class of polynomials, including non-orthogonal polynomials.

Go to article

Inverse Wavelet Reconstruction For Resolving The Gibbs Phenomenon, Nataniel Greene Jan 2008

Inverse Wavelet Reconstruction For Resolving The Gibbs Phenomenon, Nataniel Greene

Publications and Research

The Gibbs phenomenon refers to the lack of uniform convergence which occurs in many orthogonal basis approximations to piecewise smooth functions. This lack of uniform convergence manifests itself in spurious oscillations near the points of discontinuity and a low order of convergence away from the discontinuities. Here we describe a numerical procedure for overcoming the Gibbs phenomenon called the inverse wavelet reconstruction method. The method takes the Fourier coefficients of an oscillatory partial sum and uses them to construct the wavelet coefficients of a non-oscillatory wavelet series.

Go to article

Some Results Of Backward Itô Formula, Guiseppe Da Prato, Jose-Luis Menaldi, Luciano Tubaro May 2007

Some Results Of Backward Itô Formula, Guiseppe Da Prato, Jose-Luis Menaldi, Luciano Tubaro

Mathematics Faculty Research Publications

We use the notion of backward integration, with respect to a general Lévy process, to treat, in a simpler and unifying way, various classical topics as: Girsanov theorem, rst order partial differential equations, the Liouville (or Lyapunov) equations and the stochastic characteristic method.

Go to article

Approximations Of Continuous Newton's Method: An Extension Of Cayley's Problem, Jon T. Jacobsen, Owen Lewis '05, Bradley Tennis '06 Feb 2007

Approximations Of Continuous Newton's Method: An Extension Of Cayley's Problem, Jon T. Jacobsen, Owen Lewis '05, Bradley Tennis '06

All HMC Faculty Publications and Research

Continuous Newton's Method refers to a certain dynamical system whose associated flow generically tends to the roots of a given polynomial. An Euler approximation of this system, with step size h=1, yields the discrete Newton's method algorithm for finding roots. In this note we contrast Euler approximations with several different approximations of the continuous ODE system and, using computer experiments, consider their impact on the associated fractal basin boundaries of the roots

Go to article

Epi-Convergent Discretization Of The Generalizaed Bolza Problem In Dynamic Optimization, Boris S. Mordukhovich, Teemu Pennanen Dec 2006

Epi-Convergent Discretization Of The Generalizaed Bolza Problem In Dynamic Optimization, Boris S. Mordukhovich, Teemu Pennanen

Mathematics Research Reports

The paper is devoted to well-posed discrete approximations of the so-called generalized Bolza problem of minimizing variational functionals defined via extended-real-valued functions. This problem covers more conventional Bolza-type problems in the calculus of variations and optimal control of differential inclusions as well of parameterized differential equations. Our main goal is find efficient conditions ensuring an appropriate epi-convergence of discrete approximations, which plays a significant role in both the qualitative theory and numerical algorithms of optimization and optimal control. The paper seems to be the first attempt to study epi-convergent discretizations of the generalized Bolza problem; it establishes several rather general …

Go to article

Can We Have Superconvergent Gradient Recovery Under Adaptive Meshes?, Haijun Wu, Zhimin Zhang Aug 2006

Can We Have Superconvergent Gradient Recovery Under Adaptive Meshes?, Haijun Wu, Zhimin Zhang

Mathematics Research Reports

We study adaptive finite element methods for elliptic problems with domain corner singularities. Our model problem is the two dimensional Poisson equation. Results of this paper are two folds. First, we prove that there exists an adaptive mesh (gauged by a discrete mesh density function) under which the recovered.gradient by the Polynomial Preserving Recovery (PPR) is superconvergent. Secondly, we demonstrate by numerical examples that an adaptive procedure with a posteriori error estimator based on PPR does produce adaptive meshes satisfy our mesh density assumption, and the recovered gradient by PPR is indeed supercoveregent in the adaptive process.

Go to article

Remarks On Risk-Sensitive Control Problems, José Luis Menaldi, Maurice Robin Oct 2005

Remarks On Risk-Sensitive Control Problems, José Luis Menaldi, Maurice Robin

Mathematics Faculty Research Publications

The main purpose of this paper is to investigate the asymptotic behavior of the discounted risk-sensitive control problem for periodic diffusion processes when the discount factor α goes to zero. If uα(θ, x) denotes the optimal cost function, being the risk factor, then it is shown that limα→0αuα(θ, x) = ξ(θ) where ξ(θ) is the average on ]0, θ[ of the optimal cost of the (usual) in nite horizon risk-sensitive control problem.

Go to article

Time-Dependent Thermal Imaging Of Circular Inclusions, Donald L. Brouwn, Mark Hubenthal Jul 2005

Time-Dependent Thermal Imaging Of Circular Inclusions, Donald L. Brouwn, Mark Hubenthal

Mathematical Sciences Technical Reports (MSTR)

This paper considers the inverse problem of locating one or more circular inclusions in a two-dimensional domain using thermal boundary data, specifically, the input heat flux and measured boundary temperature. The forward problem is governed by the heat equation. We show how the position and size of such defects can be recovered using the boundary data and various approximations of the solution to the forward problem. We also consider the stability of the algorithm involved to recover the defects.

Go to article

Lower Bounds For Simplicial Covers And Triangulations Of Cubes, Adam Bliss '03, Francis E. Su Apr 2005

Lower Bounds For Simplicial Covers And Triangulations Of Cubes, Adam Bliss '03, Francis E. Su

All HMC Faculty Publications and Research

We show that the size of a minimal simplicial cover of a polytope P is a lower bound for the size of a minimal triangulation of P, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and we improve lower bounds for covers and triangulations in dimensions 4 through at least 12 (and possibly more dimensions as well). Important ingredients are an analysis of the number of exterior faces that a simplex in the cube can have of a specified dimension and volume, and a characterization of corner simplices in terms of their …

Go to article

Reconstruction Of Partially Conductive Cracks Using Boundary Data, David Mccune, Janine Haugh Sep 2004

Reconstruction Of Partially Conductive Cracks Using Boundary Data, David Mccune, Janine Haugh

Mathematical Sciences Technical Reports (MSTR)

This paper develops an algorithm for finding one or more non-insulated, pair-wise disjoint, linear cracks in a two dimensional region using boundary measurements.

Go to article

Reconstruction Of An Unknown Boundary Portion From Cauchy Data In N-Dimensions, Kurt M. Bryan, Lester Caudill Jul 2004

Reconstruction Of An Unknown Boundary Portion From Cauchy Data In N-Dimensions, Kurt M. Bryan, Lester Caudill

Mathematical Sciences Technical Reports (MSTR)

We consider the inverse problem of determining the shape of some inacces­ sible portion of the boundary of a region in n dimensions from Cauchy data for the heat equation on an accessible portion of the boundary. The inverse problem is quite ill-posed, and nonlinear. We develop a Newton-like algorithm for solving the problem, with a simple and efficient means for computing the required derivatives, develop methods for regularizing the process, and provide computational examples

Go to article

Determining The Length Of A One-Dimensional Bar, Natalya Yarlikina, Holly Walrath Jul 2004

Determining The Length Of A One-Dimensional Bar, Natalya Yarlikina, Holly Walrath

Mathematical Sciences Technical Reports (MSTR)

In this paper we examine the inverse problem of determining the length of a one-dimensional bar from thermal measurements (temperature and heat flux) at one end of the bar (the "accessible" end); the other inaccessible end of the bar is assumed to be moving. We develop two different approaches to estimating the length of the bar, and show how one approach can also be adapted to find unknown boundary conditions at the inaccessible end of the bar.

Go to article

Natural Superconvergent Points Of Triangular Finite Elements, Zhimin Zhang, Runchang Lin Jul 2003

Natural Superconvergent Points Of Triangular Finite Elements, Zhimin Zhang, Runchang Lin

Mathematics Research Reports

In this work, we analytically identify natural superconvergent points of function values and gradients for triangular elements. Both the Poisson equation and the Laplace equation are discussed for polynomial finite element spaces (with degrees up to 8) under four different mesh patterns. Our results verify computer findings of [2], especially, we confirm that the computed data have 9 digits of accuracy with an exception of one pair (which has 8-7 digits of accuracy). In addition, we demonstrate that the function value superconvergent points predicted by the symmetry theory [14] are the only superconvergent points for the Poisson equation. Finally, we …

Go to article

Characterizing A Defect In A One-Dimensional Bar, Cynthia Gangi, Sameer Shah Sep 2002

Characterizing A Defect In A One-Dimensional Bar, Cynthia Gangi, Sameer Shah

Mathematical Sciences Technical Reports (MSTR)

We examine the inverse problem of locating and describing an internal point defect in a one­ dimensional rod W by controlling the heat inputs and measuring the subsequent temperatures at the boundary of W. We use a variation of the forward heat equation to model heat flow through W, then propose algorithms for locating an internal defect and quantifying the effect the defect has on the heat flow. We implement these algorithms, analyze the stability of the procedures, and provide several computational examples.

Go to article

A Posteriori Error Estimates Based On Polynomial Preserving Recovery, Zhimin Zhang, Ahmed Naga Sep 2002

A Posteriori Error Estimates Based On Polynomial Preserving Recovery, Zhimin Zhang, Ahmed Naga

Mathematics Research Reports

Superconvergence of order O(h1+rho), for some rho is greater than 0, is established for gradients recovered using Polynomial Preserving Recovery technique when the mesh is mildly structured. Consequently this technique can be used in building a posteriori error estimator that is asymptotically exact.

Go to article

Gradient Recovery And A Posteriori Estimate For Bilinear Element On Irregular Quadrilateral Meshes, Zhimin Zhang Aug 2002

Gradient Recovery And A Posteriori Estimate For Bilinear Element On Irregular Quadrilateral Meshes, Zhimin Zhang

Mathematics Research Reports

A polynomial preserving gradient recovery method is proposed and analyzed for bilinear element under general quadrilateral meshes. It has been proven that the recovered gradient converges at a rate O(h1+rho) for rho = min(alpha, 1) when the mesh is distorted O(h1+alpha) (alpha > 0) from a regular one. Consequently, the a posteriori error estimator based on the recovered gradient is asymptotically exact.

Go to article

Analysis Of Recovery Type A Posteriori Error Estimators For Mildly Structured Grids, Jinchao Xu, Zhimin Zhang Jul 2002

Analysis Of Recovery Type A Posteriori Error Estimators For Mildly Structured Grids, Jinchao Xu, Zhimin Zhang

Mathematics Research Reports

Some recovery type error estimators for linear finite element method are analyzed under O(h1+alpha) (alpha greater than 0) regular grids. Superconvergence is established for recovered gradients by three different methods when solving general non-self-adjoint second-order elliptic equations. As a consequence, a posteriori error estimators based on those recovery methods are asymptotically exact.

Go to article

First Prev Next Last