Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Analysis
Data And Algorithmic Modeling Approaches To Count Data, Andraya Hack
Data And Algorithmic Modeling Approaches To Count Data, Andraya Hack
Honors College Theses
Various techniques are used to create predictions based on count data. This type of data takes the form of a non-negative integers such as the number of claims an insurance policy holder may make. These predictions can allow people to prepare for likely outcomes. Thus, it is important to know how accurate the predictions are. Traditional statistical approaches for predicting count data include Poisson regression as well as negative binomial regression. Both methods also have a zero-inflated version that can be used when the data has an overabundance of zeros. Another procedure is to use computer algorithms, also known as …
New Characterizations Of Reproducing Kernel Hilbert Spaces And Applications To Metric Geometry, Daniel Alpay, Palle E. T. Jorgensen
New Characterizations Of Reproducing Kernel Hilbert Spaces And Applications To Metric Geometry, Daniel Alpay, Palle E. T. Jorgensen
Mathematics, Physics, and Computer Science Faculty Articles and Research
We give two new global and algorithmic constructions of the reproducing kernel Hilbert space associated to a positive definite kernel. We further present a general positive definite kernel setting using bilinear forms, and we provide new examples. Our results cover the case of measurable positive definite kernels, and we give applications to both stochastic analysis and metric geometry and provide a number of examples.
The Convergence Of V-Cycle Multigrid Algorithms For Axisymmetric Laplace And Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak
The Convergence Of V-Cycle Multigrid Algorithms For Axisymmetric Laplace And Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak
Mathematics and Statistics Faculty Publications and Presentations
We investigate some simple finite element discretizations for the axisymmetric Laplace equation and the azimuthal component of the axisymmetric Maxwell equations as well as multigrid algorithms for these discretizations. Our analysis is targeted at simple model problems and our main result is that the standard V-cycle with point smoothing converges at a rate independent of the number of unknowns. This is contrary to suggestions in the existing literature that line relaxations and semicoarsening are needed in multigrid algorithms to overcome difficulties caused by the singularities in the axisymmetric Maxwell problems. Our multigrid analysis proceeds by applying the well known regularity …
Analysis Of A Multigrid Algorithm For Time Harmonic Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak, Leszek Demkowicz
Analysis Of A Multigrid Algorithm For Time Harmonic Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak, Leszek Demkowicz
Mathematics and Statistics Faculty Publications and Presentations
This paper considers a multigrid algorithm suitable for efficient solution of indefinite linear systems arising from finite element discretization of time harmonic Maxwell equations. In particular, a "backslash" multigrid cycle is proven to converge at rates independent of refinement level if certain indefinite block smoothers are used. The method of analysis involves comparing the multigrid error reduction operator with that of a related positive definite multigrid operator. This idea has previously been used in multigrid analysis of indefinite second order elliptic problems. However, the Maxwell application involves a nonelliptic indefinite operator. With the help of a few new estimates, the …
Multigrid For The Mortar Finite Element Method, Jay Gopalakrishnan, Joseph E. Pasciak
Multigrid For The Mortar Finite Element Method, Jay Gopalakrishnan, Joseph E. Pasciak
Mathematics and Statistics Faculty Publications and Presentations
A multigrid technique for uniformly preconditioning linear systems arising from a mortar finite element discretization of second order elliptic boundary value problems is described and analyzed. These problems are posed on domains partitioned into subdomains, each of which is independently triangulated in a multilevel fashion. The multilevel mortar finite element spaces based on such triangulations (which need not align across subdomain interfaces) are in general not nested. Suitable grid transfer operators and smoothers are developed which lead to a variable Vcycle preconditioner resulting in a uniformly preconditioned algebraic system. Computational results illustrating the theory are also presented.