Browsing Computational and Applied Mathematics by Title
Now showing items 258277 of 779

Collaborative Spectrum Sensing from Sparse Observations Using Matrix Completion
(200912)In cognitive radio, spectrum sensing is a key component to detect spectrum holes (i.e., channels not used by any primary users). Collaborative spectrum sensing among the cognitive radio nodes is expected to improve the ... 
ColumnSecant Update Technique for Solving Systems of Nonlinear Equations
(199110)This paper presents a QR update implementation of the successive column correction (SCC) method and a columnsecant modification of the SCC method, which is called the CSSCC method. The computational cost of the QR update ... 
Comparing Objective Functions for Velocity Inversion
(199310)The success of automatic velocity inversion is highly dependent on the numerical tractability of the optimization problem which defines the solution. The purpose of this paper is to compare the objective (cost) functions ... 
Comparing Problem Formulation for Coupled Sets of Component
(200711)In this paper several formulations and comparative test results are presented for problems involving the general paradigm of coupled sets of components. This paradigm is general enough to include systems of systems (SoS) ... 
A Comparison of High Order Interpolation Nodes for the Pyramid
(2015)The use of pyramid elements is crucial to the construction of efficient hexdominant meshes [M. Bergot, G. Cohen, and M. Duruflé, J. Sci. Comput., 42 (2010), pp. 345381]. For conforming nodal finite element methods with ... 
Comparison of Reduced Models for Blood Flow Using Runge–Kutta Discontinuous Galerkin Methods
(201511)Reduced, or one–dimensional blood flow models take the general form of nonlinear hyperbolic systems, but differ greatly in their formulation. One class of models considers the physically conserved quantities of mass and ... 
Comparison of Two Sets of Firstorder Conditions as Bases of InteriorPoint Newton Methods for Optimization with Simple Bounds
(200106)In this paper, we compare the behavior of two Newton interiorpoint methods derived from two different firstorder necessary conditions for the same nonlinear optimization problem with simple bounds. One set of conditions ... 
Complex Flow and Transport Phenomena in Porous Media
(201004)This thesis analyzes partial differential equations related to the coupled surface and subsurface flows and develops efficient high order discontinuous Galerkin (DG) methods to solve them numerically. Specifically, the ... 
Compositional heterogeneity near the base of the mantle transition zone beneath Hawaii
(2018)Global seismic discontinuities near 410 and 660 km depth in Earth’s mantle are expressions of solidstate phase transitions. These transitions modulate thermal and material fluxes across the mantle and variations in their ... 
Compressive Sensing Based High Resolution Channel Estimation for OFDM System
(201108)Orthogonal frequency division multiplexing (OFDM) is a technique that will prevail in the next generation wireless communication. Channel estimation is one of the key challenges in OFDM, since highresolution channel ... 
Compressive Sensing for 3D Data Processing Tasks: Applications, Models and Algorithms
(201112)Compressive sensing (CS) is a novel sampling methodology representing a paradigm shift from conventional data acquisition schemes. The theory of compressive sensing ensures that under suitable conditions compressible signals ... 
Computation of Eigenvalues for Starlike Domains
(1994)In this paper, we present a software tool for the computation of eigenvalues of starlike domains defined by polar boundary functions. We also offer and numerically test a conjecture on the monotonicity of the fundamental ... 
Computation of PseudoDifferential Operators
(199211)A simple algorithm is described for computing general pseudodifferential operator actions. Our approach is based on the asymptotic expansion of the symbol together with the Fast Fourier Transform (FFT). The idea is motivated ... 
Computational Experience of an Augmented Lagrangian for Nonlinear Programming as a Merit Function in a PrimalDual InteriorPoint Method
(199510)In this paper we extend the L² augmented Lagrangian function from equality constrained problems to nonlinear programming problems. The augmentation is strongly influenced by interiorpoint philosophy. Only information about ... 
Computational Experience with Lenstra's Algorithm
(200208)Integer programming is an important mathematical approach for many decisionmaking problems. In this field, a major theoretical breakthrough came in 1983 when H. W. Lenstra, Jr. proposed a polynomialtime algorithm for a ... 
Computational Modeling of Internal Surfaces in AusteniteMartensite System
(200306)In this work, we present a new computational method based on a nonconforming domain decomposition technique for modeling of phase transitions. Phase transitions are the result of thermal or mechanical loading in ferromagnetic ... 
Computing a CelisDennis Tapia Trust Region Step for Equality Constrained Optimization
(198812)We study an approach for minimizing a convex quadratic function subject to two quadratic constraints. This problem stems from computing a trust region step for an SQP algorithm proposed by Celis, Dennis and Tapia (1984) ... 
Computing Distances Between Convex Sets and Subsets of the Positive Semidefinite Matrices
(199703)We describe an important class of semidefinite programming problems that has received scant attention in the optimization community. These problems are derived from considerations in distance geometry and multidimensional ... 
Concavity Cuts for Disjoint Bilinear Programming
(199909)We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin reformulations, leading to two sets of concavity cuts. We first ...