Mathematics Commons^™

Paved With Good Intentions: Analysis Of A Randomized Block Kaczmarz Method, Deanna Needell, Joel A. Tropp

CMC Faculty Publications and Research

The block Kaczmarz method is an iterative scheme for solving overdetermined least-squares problems. At each step, the algorithm projects the current iterate onto the solution space of a subset of the constraints. This paper describes a block Kaczmarz algorithm that uses a randomized control scheme to choose the subset at each step. This algorithm is the first block Kaczmarz method with an (expected) linear rate of convergence that can be expressed in terms of the geometric properties of the matrix and its submatrices. The analysis reveals that the algorithm is most effective when it is given a good row paving …

Multiscale Geometric Modeling Of Macromolecules I: Cartesian Representation, Kelin Xia, Xin Feng, Zhan Chen, Yiying Tong, Guo-Wei Wei

Mathematical Sciences: Faculty Publications

This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace–Beltrami flows for biomolecular surface evolution and formation. The …

A Simple Proof For The Number Of Tilings Of Quartered Aztec Diamonds, Tri Lai

Department of Mathematics: Faculty Publications

We get four quartered Aztec diamonds by dividing an Aztec diamond region by two zigzag cuts passing its center. W. Jockusch and J. Propp (in an unpublished work) found that the number of tilings of quartered Aztec diamonds is given by simple product formulas. In this paper we present a simple proof for this result.

Using Prior Knowledge And Learning From Experience In Estimation Of Distribution Algorithms, Mark Walter Hauschild

Dissertations

Estimation of distribution algorithms (EDAs) are stochastic optimization techniques that explore the space of potential solutions by building and sampling explicit probabilistic models of promising candidate solutions. One of the primary advantages of EDAs over many other stochastic optimization techniques is that after each run they leave behind a sequence of probabilistic models describing useful decompositions of the problem. This sequence of models can be seen as a roadmap of how the EDA solves the problem. While this roadmap holds a great deal of information about the problem, until recently this information has largely been ignored. My thesis is that …

Quantitative K-Theory And Spin Chern Numbers [Dataset], Terry A. Loring

Math and Statistics Datasets

We examine the various indices defined on pairs of almost commuting unitary matrices that can detect pairs that are far from commuting pairs. We do this is two symmetry classes, that of general unitary matrices and that of self-dual matrices, with an emphasis on quantitative results. We determine what values of the norm of the commutator guarantee that the indices are defined, where they are equal, and what quantitative results on the distance to a pair with a different index are possible. We validate a method of computing spin Chern numbers that was developed with Hastings and only conjectured to …

Assessing The Optimal Virulence Of Malaria‐Targeting Mosquito Pathogens: A Mathematical Study Of Engineered Metarhizium Anisopliae, Bernhard Konrad, Michael R. Lindstrom, Anja Gumpinger, Jielin Zhu, Daniel Coombs

School of Mathematical & Statistical Sciences Faculty Publications

Background

Metarhizium anisopliae is a naturally occurring fungal pathogen of mosquitoes. Recently, Metarhizium has been engineered to act against malaria by directly killing the disease agent within mosquito vectors and also effectively blocking onward transmission. It has been proposed that efforts should be made to minimize the virulence of the fungal pathogen, in order to slow the development of resistant mosquitoes following an actual deployment.

Results

Two mathematical models were developed and analysed to examine the efficacy of the fungal pathogen. It was found that, in many plausible scenarios, the best effects are achieved with a reduced or minimal pathogen …

A Sampling Of Popular Books For Numeracy Readers, Michael T. Catalano

Numeracy

Popular books on quantitative themes are seemingly more available than ever. In this book review, we look at five such books from a wide range of authors. Although the books are written for diverse audiences, all provide examples and discussion of concepts that could be used in courses with quantitative literacy objectives. The books are Guesstimation and Guesstimation 2.0 by Lawrence Weinstein and John A. Adam, and Weinstein, respectively; Turning Numbers into Knowledge: Mastering the Art of Problem Solving, by Jonathan G. Koomey; How to Measure Anything: Finding The Value of “Intangibles” in Business, by Douglas W. Hubbard; and …

Variations Of The Feast Eigenvalue Algorithm, Stephanie Kajpust

Dissertations, Master's Theses and Master's Reports - Open

FEAST is a recently developed eigenvalue algorithm which computes selected interior eigenvalues of real symmetric matrices. It uses contour integral resolvent based projections. A weakness is that the existing algorithm relies on accurate reasoned estimates of the number of eigenvalues within the contour. Examining the singular values of the projections on moderately-sized, randomly-generated test problems motivates orthogonalization-based improvements to the algorithm. The singular value distributions provide experimentally robust estimates of the number of eigenvalues within the contour. The algorithm is modified to handle both Hermitian and general complex matrices. The original algorithm (based on circular contours and Gauss-Legendre quadrature) is …

Fractal Powers In Serrin's Swirling Vortex Solutions, Pavel Bělík, Douglas P. Dokken, Kurt Scholz, Mikhail M. Shvartsman

Faculty Authored Articles

We consider a modification of the fluid flow model for a tornado-like swirling vortex developed by Serrin [Phil. Trans. Roy. Soc. London, Series A, Math & Phys. Sci. 271(1214) (1972), 325–360], where velocity decreases as the reciprocal of the distance from the vortex axis. Recent studies, based on radar data of selected severe weather events [Mon. Wea. Rev. 133(9) (2005), 2535–2551; Mon. Wea. Rev. 128(7) (2000), 2135–2164; Mon. Wea. Rev. 133(1) (2005), 97–119], indicate that the angular momentum in a tornado may not be constant with the radius, and thus suggest a different scaling of the velocity/radial distance dependence. Motivated …

On The Dynamics Of Laguerre’S Iteration Method For Finding The Nth Roots Of Unity, Pavel Bělík, Heechan Kang, Andrew Walsh, Emma Winegar

Faculty Authored Articles

Previous analyses of Laguerre’s iteration method have provided results on the behavior of this popular method when applied to the polynomials 𝑝𝑛(𝑧) = 𝑧𝑛 − 1, 𝑛 ∈ N. In this paper, we summarize known analytical results and provide new results. In particular, we study symmetry properties of the Laguerre iteration function and clarify the dynamics of the method. We show analytically and demonstrate computationally that for each 𝑛 ≥ 5 the basin of attraction to the roots is a subset of an annulus that contains the unit circle and whose Lebesgue measure shrinks to zero as 𝑛 → ∞. …

Gaussian Integer Straus-Erdos, Eugen J. Ionascu

Faculty Bibliography

No abstract provided.

Pythagorean Triples Challenge, Thomas Moore

Mathematics Faculty Publications

No abstract provided.

Ideal Projections And Forcing Projections, Sean Cox, Martin Zeman

Mathematics and Applied Mathematics Publications

It is well known that saturation of ideals is closely related to the “antichain-catching” phenomenon from Foreman-Magidor-Shelah [10]. We consider several antichain-catching properties that are weaker than saturation, and prove: (1) If I is a normal ideal on ω2 which satisfies stationary antichain catching, then there is an inner model with a Woodin cardinal; (2) For any n ∈ ω, it is consistent relative to large cardinals that there is a normal ideal I on ωn which satisfies projective antichain catching, yet I is not saturated (or even strong). This provides a negative answer to Open Question number 13 from …

A Linear Iteration Algorithm For A Second-Order Energy Stable Scheme For A Thin Film Model Without Slope Selection, Wenbin Chen, Cheng Wang, Xiaoming Wang, Steven M. Wise

Mathematics and Statistics Faculty Research & Creative Works

We present a linear iteration algorithm to implement a second-order energy stable numerical scheme for a model of epitaxial thin film growth without slope selection. the PDE, which is a nonlinear, fourth-order parabolic equation, is the L 2 gradient flow of the energy d x. the energy stability is preserved by a careful choice of the second-order temporal approximation for the nonlinear term, as reported in recent work (Shen et al. in SIAM J Numer Anal 50:105-125, 2012). the resulting scheme is highly nonlinear, and its implementation is non-trivial. in this paper, we propose a linear iteration algorithm to solve …

Coloring Hypercomplete And Hyperpath Graphs, Yusuf Ci̇van, Demet Taylan

Turkish Journal of Mathematics

Given a graph G with an induced subgraph H and a family F of graphs, we introduce a (hyper)graph H_H(G;F)=(V_H, E_H), the hyper-H (hyper)graph of G with respect to F, whose vertices are induced copies of H in G, and \{H_1,H_2,\ldots,H_r\} \in E_H if and only if the induced subgraph of G by the set \cup_{i=1}^r H_i is isomorphic to a graph F in the family F, and the integer r is the least integer for F with this property. When H is a k-complete or a k-path of G, we abbreviate H_{K_k}(G;F) and H_{P_k}(G;F) to H_k(G;F) and HP_k(G;F), respectively. …

Euler-Seidel Matrices Over F_P, Nesri̇n Tutaş

Turkish Journal of Mathematics

A Euler--Seidel matrix is determined by an infinite sequence whose elements are given by recursion. The recurrence relations are investigated for numbers and polynomials such as hyperharmonics, Lucas numbers, and Euler and Genocchi polynomials. Linear recurring sequences in finite fields are employed, for instance, in coding theory and in several branches of electrical engineering. In this work, we define the period of a Euler--Seidel matrix over a field F_p with p elements, where p is a prime number. We give some results for the matrix whose initial sequence is \{s_r(n)\}_{n=0}^{\infty}, where s_r(n)=\sum_{k=0}^n {\binom{n}{k}}^r, n \geq 0, and r is a …

On Betti Series Of The Universal Modules Of Second Order Derivations Of \Frac{K[X_1,X_2,...,X_S]}{(F)}, Ali̇ Erdoğan, Hali̇se Meli̇s Teki̇n Akçi̇n

Turkish Journal of Mathematics

Let R be a coordinate ring of an affine irreducible curve represented by \frac{k[x_1,x_2,...,x_s]}{(f)} and m be a maximal ideal of R. In this article, the Betti series of \Omega_2(R_m) is studied. We proved that the Betti series of \Omega_2(R_m), where \Omega_2(R_m) denotes the universal module of second order derivations of R_m, is a rational function under some conditions.

Some Results On T-Noncosingular Modules, Rachid Tribak

Turkish Journal of Mathematics

The notion of T-noncosingularity of a module has been introduced and studied recently. In this article, a number of new results of this property are provided. It is shown that over a commutative semilocal ring R such that Jac(R) is a nil ideal, every T-noncosingular module is semisimple. We prove that for a perfect ring R, the class of T-noncosingular modules is closed under direct sums if and only if R is a primary decomposable ring. Finitely generated T-noncosingular modules over commutative rings are shown to be precisely those having zero Jacobson radical. We also show that for a simple …

A Class Of Uniquely (Strongly) Clean Rings, Orhan Gürgün, Ayşe Çi̇ğdem Özcan

Turkish Journal of Mathematics

In this paper we call a ring R \delta_r-clean if every element is the sum of an idempotent and an element in \delta(R_R) where \delta(R_R) is the intersection of all essential maximal right ideals of R. If this representation is unique (and the elements commute) for every element we call the ring uniquely (strongly) \delta_r-clean. Various basic characterizations and properties of these rings are proved, and many extensions are investigated and many examples are given. In particular, we see that the class of \delta_r-clean rings lies between the class of uniquely clean rings and the class of exchange rings, and …

On The Structure Of Some Modules Over Generalized Soluble Groups, Leonid Andreevich Kurdachenko, Igor Yakov Subbotin, Vasiliy Anatolievich Chupordya

Turkish Journal of Mathematics

Let R be a ring and G a group. An R-module A is said to be Artinian-by-(finite rank) if Tor_R(A) is Artinian and A/ Tor_R(A) has finite R-rank. We study a module A over a group ring RG such that A/C_A(H) is Artinian-by-(finite rank) (as an R-module) for every proper subgroup H.