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

Applied Mathematics Commons™

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

2011

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 241 - 252 of 252

Full-Text Articles in Applied Mathematics

Symmetric Nonconforming Mixed Finite Elements For Linear Elasticity, Jay Gopalakrishnan, Johnny Guzmán Jan 2011

Symmetric Nonconforming Mixed Finite Elements For Linear Elasticity, Jay Gopalakrishnan, Johnny Guzmán

Mathematics and Statistics Faculty Publications and Presentations

We present a family of mixed methods for linear elasticity that yield exactly symmetric, but only weakly conforming, stress approximations. The method is presented in both two and three dimensions (on triangular and tetrahedral meshes). The method is efficiently implementable by hybridization. The degrees of freedom of the Lagrange multipliers, which approximate the displacements at the faces, solve a symmetric positive-definite system. The design and analysis of this method is motivated by a new set of unisolvent degrees of freedom for symmetric polynomial matrices. These new degrees of freedom are also used to give a new simple calculation of the …


Paley-Wiener Theorems With Respect To The Spectral Parameter, Susanna Dann Jan 2011

Paley-Wiener Theorems With Respect To The Spectral Parameter, Susanna Dann

LSU Doctoral Dissertations

One of the important questions related to any integral transform on a manifold M or on a homogeneous space G/K is the description of the image of a given space of functions. If M=G/K, where (G,K) is a Gelfand pair, then harmonic analysis on M is closely related to the representations of G and the direct integral decomposition of L^2(M) into irreducible representations of G. R^n can be realized as the quotient R^n=E(n)/SO(n), where E(n) is the orientation preserving Euclidean motion group. The pair (E(n), SO(n)) is a Gelfand pair. Hence this realization of R^n comes with its own natural …


Algebraic Structures Using Super Interval Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2011

Algebraic Structures Using Super Interval Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The advantage of using super interval matrices is that one can build only one vector space using m × n interval matrices, but in case of super interval matrices we can have several such spaces depending on the partition on the interval matrix.

This book has seven chapters. Chapter one is introductory in nature, just introducing the super interval matrices or interval super matrices. In chapter two essential operations on super interval matrices are defined. Further in this chapter algebraic structures are defined on these super interval matrices using these operation. Using these super interval matrices semirings and semivector spaces …


Studies In Sampling Techniques And Time Series Analysis, Florentin Smarandache, Rajesh Singh Jan 2011

Studies In Sampling Techniques And Time Series Analysis, Florentin Smarandache, Rajesh Singh

Branch Mathematics and Statistics Faculty and Staff Publications

This book has been designed for students and researchers who are working in the field of time series analysis and estimation in finite population. There are papers by Rajesh Singh, Florentin Smarandache, Shweta Maurya, Ashish K. Singh, Manoj Kr. Chaudhary, V. K. Singh, Mukesh Kumar and Sachin Malik. First chapter deals with the problem of time series analysis and the rest of four chapters deal with the problems of estimation in finite population. The book is divided in five chapters as follows: Chapter 1. Water pollution is a major global problem. In this chapter, time series analysis is carried out …


Algebraic Structures Using Natural Class Of Intervals, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2011

Algebraic Structures Using Natural Class Of Intervals, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

Authors in this book introduce a new class of intervals called the natural class of intervals, also known as the special class of intervals or as natural intervals. These intervals are built using increasing intervals, decreasing intervals and degenerate intervals. We say an interval [a, b] is an increasing interval if a < b for any a, b in the field of reals R. An interval [a, b] is a decreasing interval if a > b and the interval [a, b] is a degenerate interval if a = b for a, b in the field of reals R. The natural class of intervals consists of the collection of increasing intervals, decreasing intervals and the degenerate intervals. Clearly R is contained in the natural …


Study Of Natural Class Of Intervals Using (–∞,∞) And (∞, –∞), Florentin Smarandache, W.B. Vasantha Kandasamy, D. Datta, H.S. Kushwaha, P.A. Jadhav Jan 2011

Study Of Natural Class Of Intervals Using (–∞,∞) And (∞, –∞), Florentin Smarandache, W.B. Vasantha Kandasamy, D. Datta, H.S. Kushwaha, P.A. Jadhav

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors study the properties of natural class of intervals built using (–∞, ∞) and (∞, –∞). These natural class of intervals behave like the reals R, as far as the operations of addition, multiplication, subtraction and division are concerned. Using these natural class of intervals we build interval row matrices, interval column matrices and m × n interval matrices. Several properties about them are defined and studied. Also all arithmetic operations are performed on them in the usual way. The authors by defining so have made it easier for operations like multiplication, addition, finding determinant and …


Dsm Super Vector Space Of Refined Labels, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2011

Dsm Super Vector Space Of Refined Labels, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of supermatrices of refined labels. Authors prove super row matrix of refined labels form a group under addition. However super row matrix of refined labels do not form a group under product; it only forms a semigroup under multiplication. In this book super column matrix of refined labels and m × n matrix of refined labels are introduced and studied. We mainly study this to introduce to super vector space of refined labels using matrices. We in this book introduce the notion of semifield of refined labels using which …


Physical Process Models As Regularization Constraints On Geophysical Imaging Problems, Rachel Grotheer Jan 2011

Physical Process Models As Regularization Constraints On Geophysical Imaging Problems, Rachel Grotheer

All Theses

Obtaining accurate images of solute plumes in the subsurface is important to understand site-specific subsurface flow and transport processes. Since image reconstruction is an inverse problem, its ill-posed nature makes obtaining an accurate, high-resolution image difficult. Further, current geophysical methods for plume imaging do not take into account models of the specific process being targeted for imaging.
The main objective of the research is to find a suitable basis that gives a sparse representation of the plume. In future work, we seek to use this basis as a physical constraint during the inversion so as to increase accuracy in imaging. …


On Constrained Optimization Schemes For Joint Inversion Of Geophysical Datasets, Uram Anibal Sosa Aguirre Jan 2011

On Constrained Optimization Schemes For Joint Inversion Of Geophysical Datasets, Uram Anibal Sosa Aguirre

Open Access Theses & Dissertations

In the area of geological sciences, there exist several experimental techniques used to advance in the understanding of the Earth. We implement a joint inversion least-squares (LSQ) algorithm to characterize one dimensional Earth's structure by using seismic shear wave velocities as a model parameter. We use two geophysical datasets sensitive to shear velocities, namely Receiver Function and Surface Wave dispersion velocity observations, with a choice of an optimization method: Truncated Singular Value Decomposition (TSVD) or Primal-Dual Interior-Point (PDIP). The TSVD and the PDIP methods solve a regularized unconstrained and a constrained minimization problem, respectively. Both techniques include bounds into the …


Software Development For A Three-Dimensional Gravity Inversion And Application To Study Of The Border Ranges Fault System, South-Central Alaska, Rolando Cardenas Jan 2011

Software Development For A Three-Dimensional Gravity Inversion And Application To Study Of The Border Ranges Fault System, South-Central Alaska, Rolando Cardenas

Open Access Theses & Dissertations

The Border Ranges Fault System (BRFS) bounds the Cook Inlet and Susitna Basins, an important petroleum province within south-central Alaska. A primary goal in the research is to test several plausible models of structure along the Border Ranges Fault System using a novel three-dimensional inversion utilizing gravity and magnetic data, constrained with other geophysical, borehole and surface geological information. This research involves the development of inversion modeling software using a Borland C++ compiler as part of the Rapid Application Development (RAD) Studio. The novel inversion approach directly models known geology, and "a priori" uncertainties on the geologic model to allow …


Digital Image Processing Based On Sparse Representation And Convex Programming, Carlos Andres Ramirez Jan 2011

Digital Image Processing Based On Sparse Representation And Convex Programming, Carlos Andres Ramirez

Open Access Theses & Dissertations

Sparse representation models have been of central interest in recent years due to important achievements in computational harmonic analysis, such as wavelet transformations, and the most recent sampling theory, compressed sensing. Numerous applications based on sparse models have been studied in the last decade leading to promising results. These applications include areas in seismology, image processing, wireless sensor networks, computed tomography and magnetic resonance imaging just to mention a few.

In this work, we propose to extend such applications in the area of image processing, particularly for the image segmentation problem, and examine algorithms involved in sparse modeling from both …


A Sparse Representation Technique For Classification Problems, Reinaldo Sanchez Arias Jan 2011

A Sparse Representation Technique For Classification Problems, Reinaldo Sanchez Arias

Open Access Theses & Dissertations

In pattern recognition and machine learning, a classification problem refers to finding an algorithm for assigning a given input data into one of several categories. Many natural signals are sparse or compressible in the sense that they have short representations when expressed in a suitable basis. Motivated by the recent successful development of algorithms for sparse signal recovery, we apply the selective nature of sparse representation to perform classification. In order to find such sparse linear representation, we implement an l1-minimization algorithm. This methodology overcomes the lack of robustness with respect to outliers. In contrast to other classification …