Applied Mathematics Commons^™

On The P-Connectedness Of Graphs – A Survey, Luitpold Babel, Stephan Olariu

Computer Science Faculty Publications

A graph is said to be p-connected if for every partition of its vertices into two non-empty, disjoint, sets some chordless path with three edges contains vertices from both sets in the partition. As it turns out, p-connectedness generalizes the usual connectedness of graphs and leads, in a natural way, to a unique tree representation for arbitrary graphs.

This paper reviews old and new results, both structural and algorithmic, about p-connectedness along with applications to various graph decompositions.

(A Note On)(2) The Shape Of The Erythrocyte, J. A. Adam

Mathematics & Statistics Faculty Publications

A note on the shape of the red blood cell is revisited, utilizing variational calculus to to find an extremum for the surface area of such a cell, using the volume as a constraint. A fairly significant error in the value of the volume is corrected, and the note concludes with a discussion of measures of cell shape (such as the sphericity index) which are more appropriate than the dimensional surface area to volume ratio.

Uniform Lipschitz Continuity Of Best L(P)-Approximations By Polyhedral Sets, Martina Finzel, Wu Li

Mathematics & Statistics Faculty Publications

In this paper we prove that the metric projection Π_{k, p} onto a polyhedral subset K of ℝⁿ, endowed with the p-norm, is uniformly Lipschitz continuous with respect to p,1 , p , ∞. As a consequence the strict best approximation and the natural best approximation are Lipschitz continuous selections for the metric projections Π_k, _∞ and Π_k,1, respectively. This extends a recent analogous result in Berens et al. [J.Math. Anal. Appl. 213 1997, 183-201] on linear subspaces.

Error Correcting Codes Associated With Complex Hadamard Matrices, I. Heng, C. H. Cooke

Mathematics & Statistics Faculty Publications

For primes p > 2, the generalized Hadamard matrix H(p,pt) can be expressed as H = x^A, where the notation means h_ij = x^aij. It is shown that the row vectors of A represent a p-ary error correcting code. Depending upon the value of t, either linear or nonlinear codes emerge. Code words are equidistant and have minimum Hamming distance d = (p − 1)t. The code can be extended so as to possess N = p²t code words of length pt …

The Adjoint Alternative For Matrix Operators, C. H. Cooke

Mathematics & Statistics Faculty Publications

The following inverse problem is considered: given a matrix B of rank r, does there exist a matrix A such that

B = T(A) = adjoint (A)

where the classical adjoint operation is intended? Conditions are determined on the rank of B which decides whether or not B lies in the range of the matrix adjoint operator.

Steady Incompressible Magnetohydrodynamic Flow Near A Point Of Reattachment, J. M. Dorrepaal, S. Moosavizadeh

Mathematics & Statistics Faculty Publications

The oblique stagnation-point flow of an electrically conducting fluid in the presence of a magnetic field is a highly nonlinear problem whose solution is of interest even in the simplest of geometries. The problem models the flow of a viscous conducting fluid near a point where a separation vortex reattaches itself to a rigid boundary. A similarity solution exists which reduces the problem to a coupled system of four ordinary differential equations which can be integrated numerically. The problem has two independent parameters, the conductivity of the fluid and the strength of the magnetic field. Solutions are tabulated for a …

On The Structure Of Graphs With Few P4s, Luitpold Babel, Stephan Olariu

Computer Science Faculty Publications

We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing — in some local sense — only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the internal nodes correspond to three types of graph operations, while the leaves are basic graphs with a simple structure. The paper extends and generalizes known results about cographs, P₄-reducible graphs, and P₄-sparse graphs.

A Fast Parallel Algorithm To Recognize P4-Sparse Graphs, Rong Lin, Stephan Olariu

Computer Science Faculty Publications

A number of problems in mobile computing, group-based collaboration, automated theorem proving, networking, scheduling, and cluster analysis suggested the study of graphs featuring certain “local density” characteristics. Typically, the notion of local density is equated with the absence of chordless paths of length three or more. Recently, a new metric for local density has been proposed, allowing a number of such induced paths to occur. More precisely, a graphG is called P4-sparse if no set of five vertices inG induces more than one chordless path of length three. P4-sparse graphs generalize the well-known class of cographs corresponding to …

Error-Correcting Codes Associated With Generalized Hadamard Matrices Over Groups, Iem H. Heng

Mathematics & Statistics Theses & Dissertations

Classical Hadamard matrices are orthogonal matrices whose elements are ±1. It is well-known that error correcting codes having large minimum distance between codewords can be associated with these Hadamard matrices. Indeed, the success of early Mars deep-space probes was strongly dependent upon this communication technology.

The concept of Hadamard matrices with elements drawn from an Abelian group is a natural generalization of the concept. For the case in which the dimension of the matrix is q and the group consists of the p-th roots of unity, these generalized Hadamard matrices are called “Butson Hadamard Matrices BH(p, q)”, …

Corrigendum To “Post-Surgical Passive Response Of Local Environment To Primary Tumor Removal”: Mathl. Comput. Modelling, Vol. 25, No. 6, Pp. 7–17, 1997, J. A. Adam, C. Bellomo

Mathematics & Statistics Faculty Publications

The computer program that was used to generate the graphs for the concentration of inhibitor contained an error. This influenced the scaling in the original Figures 2 and 3. As an example, a sample of the corrected graphs are given below. Copies of other corrected figures can be obtained from the authors. It is important to note that the “pulse” appears for the function rC(r, t). As can be seen, it travels slowly outward with decreasing amplitude. The mathematical analysis in the paper remains unchanged.

Correlation Of Finite Element Prediction And Experimental Measurements Of Aircraft Panel Structural Vibration, Olaf L. Storaasli

Mechanical & Aerospace Engineering Theses & Dissertations

With the rapid development of computational capabilities and the implementation of complex tools for commercial finite element programs, predicting structural dynamics and related acoustics of complex structures is presently achievable. Structural finite element modeling is a design tool widely utilized for analysis of problems of all kinds. However, high frequency vibration of complex structures, such as the reinforced aircraft panel used for this study, currently does not correlate well with experimental measurements using conventional modeling methods. An investigation into the commonly used modeling techniques as well as the new tools of commercial finite element analysis packages for the prediction of …

Post-Surgical Passive Response Of Local Environment To Primary Tumor Removal, J. A. Adam, C. Bellomo

Mathematics & Statistics Faculty Publications

Prompted by recent clinical observations on the phenomenon of metastasis inhibition by an angiogenesis inhibitor, a mathematical model is developed to describe the post-surgical response of the local environment to the “surgical” removal of a spherical tumor in an infinite homogeneous domain. The primary tumor is postulated to be a source of growth inhibitor prior to its removal at t = 0; the resulting relaxation wave arriving from the disturbed (previously steady) state is studied, closed form analytic solutions are derived, and the asymptotic speed of the pulse is estimated to be about 2 × 10⁻⁴ cm/sec for the …

Limiting Spheroid Size As A Function Of Growth Factor Source Location, J. A. Adam, K. Y. Ward

Mathematics & Statistics Faculty Publications

Solutions C(r) of the time-independent nonhomogeneous diffusion equation for three different piecewise-uniform source terms are used to examine the limiting size of multicell spheroids using a simple model which reproduces concentration-dependent mitotic behavior. A condition is derived under which nontrivial solutions do not exist (in all three cases), and a condition for the existence of a unique nontrivial solution is established for the case of growth-modifying factor (GMF) production throughout the spheroid. Qualitative behavior of the limiting size is established as a function of various physiological parameters. Of fundamental importance is the assumed GMF concentration threshold θ, …

Antiplane Shear Of A Strip Containing A Staggered Array Of Rigid Line Inclusions, G. Kerr, G. Melrose, J. Tweed

Mathematics & Statistics Faculty Publications

Motivated by the increased use of fibre-reinforced materials, we illustrate how the effective elastic modulus of an isotropic and homogeneous material can be increased by the insertion of rigid inclusions. Specifically we consider the two-dimensional antiplane shear problem for a strip of material. The strip is reinforced by introducing two sets of ribbon-like, rigid inclusions perpendicular to the faces of the strip. The strip is then subjected to a prescribed uniform displacement difference between its faces, see Figure 1. it should be noted that the problem posed is equivalent to that of the uniform antiplane shear problem for an infinite …

Hoffman’S Error Bounds And Uniform Lipschitz Continuity Of Best L(P) -Approximations, H. Berens, M. Finzel, W. Li, Y. Xu

Mathematics & Statistics Faculty Publications

In a central paper on smoothness of best approximation in 1968 R. Holmes and B. Kripke proved among others that on ℝⁿ, endowed with the l_ρ-norm, 1< p < ∞, the metric projection onto a given linear subspace is Lipschitz continuous where the Lipschitz constant depended on the parameter p. Using Hoffman’s Error Bounds as a principal tool we prove uniform Lipschitz continuity of best l_ρ -ap- proximations. As a consequence, we reprove and prove, respectively, Lipschitz. continuity of the strict best approximation (sba, p = ∞ and of the natural best approximation (nba, p = 1.

A Dual Approach To Constrained Interpolation From A Convex Subset Of Hilbert Space, Frank Deutsch, Wu Li, Joseph D. Ward

Mathematics & Statistics Faculty Publications

Many interesting and important problems of best approximationare included in (or can be reduced to) one of the followingtype: in a Hilbert spaceX, find the best approximationPK(x) to anyx∈Xfrom the setK≔C∩A−1(b),whereCis a closed convex subset ofX,Ais a bounded linearoperator fromXinto a finite-dimensional Hilbert spaceY, andb∈Y. The main point of this paper is to show thatPK(x)isidenticaltoPC(x+A*y …

The Hadamard Matroid And An Anomaly In Its Single Element Extensions, C. H. Cooke

Mathematics & Statistics Faculty Publications

A nonstandard vector space is formulated, whose bases afford a representation of what is called a Hadamard matroid, M_p. For prime p, existence of M_p is equivalent to the existence of both a classical Hadamard matrix H(p,p) and a certain affine resolvable, balanced incomplete block design AR(p). An anomaly in the representable single element extension of a Hadamard matroid is discussed.

An Invariance Property Of Common Statistical Tests, N. Rao Chaganty, A. K. Vaish

Mathematics & Statistics Faculty Publications

Let A be a symmetric matrix and B be a nonnegative definite (nnd) matrix. We obtain a characterization of the class of nnd solutions Σ for the matrix equation AΣA = B. We then use the characterization to obtain all possible covariance structures under which the distributions of many common test statistics remain invariant, that is, the distributions remain the same except for a scale factor. Applications include a complete characterization of covariance structures such that the chisquaredness and independence of quadratic forms in ANOVA problems is preserved. The basic matrix theoretic theorem itself is useful in other characterizing …

Continuities Of Metric Projection And Geometric Consequences, Robert Huotari, Wu Li

Mathematics & Statistics Faculty Publications

We discuss the geometric characterization of a subset K of a normed linear space via continuity conditions on the metricprojection onto K. The geometric properties considered includeconvexity, tubularity, and polyhedral structure. The continuityconditions utilized include semicontinuity, generalized stronguniqueness and the non-triviality of the derived mapping. Infinite-dimensional space with the uniform norm we show thatconvexity is equivalent to rotation-invariant almost convexityand we characterize those sets every rotation of which has continuousmetric projection. We show that polyhedral structure underliesgeneralized strong uniqueness of the metric projection.

The Effect Of Three-Dimensional Freestream Disturbances On The Supersonic Flow Past A Wedge, Peter W. Duck, D. Glenn Lasseigne, M. Y. Hussaini

Mathematics & Statistics Faculty Publications

The interaction between a shock wave (attached to a wedge) and small amplitude, three-dimensional disturbances of a uniform, supersonic, freestream flow are investigated. The paper extends the two-dimensional study of Duck et al. [P W. Duck, D. G. Lasseigne, and M. Y. Hussaini, ''On the interaction between the shock wave attached to a wedge and freestream disturbances,'' Theor. Comput. Fluid Dyn. 7, 119 (1995) (also ICASE Report No. 93-61)] through the use of vector potentials, which render the problem tractable by the same techniques as in the two-dimensional case, in particular by expansion of the solution by means of …

Superconvergence Of The Iterated Collocation Methods For Hammerstein Equations, Hideaki Kaneko, Richard D. Noren, Peter A. Padilla

Mathematics & Statistics Faculty Publications

In this paper, we analyse the iterated collocation method for Hammerstein equations with smooth and weakly singular kernels. The paper expands the study which began in [16] concerning the superconvergence of the iterated Galerkin method for Hammerstein equations. We obtain in this paper a similar superconvergence result for the iterated collocation method for Hammerstein equations. We also discuss the discrete collocation method for weakly singular Hammerstein equations. Some discrete collocation methods for Hammerstein equations with smooth kernels were given previously in [3, 18].

Scattering From Stellar Acoustic-Gravity Potentials: Ii. Phase Shifts Via The First Born Approximation, J. A. Adam, I. Mckaig

Mathematics & Statistics Faculty Publications

Using the first Born approximation, properties of the scattering phase shift are investigated for waves that are scattered by a schematic representation of a large-scale “stellar potential,” i.e., one for which the star itself is viewed as the potential inducing a phase shift in an incoming wave. In particular, the phase shift properties are examined as functions of the relative wavenumber (α) and the azimuthal wavenumber (l), high l-values being of interest in helioseismology.

Time-Optimal Tree Computations On Sparse Meshes, D. Bhagavathi, V. Bokka, H. Gurla, S. Olariu, J. L. Schwing

Computer Science Faculty Publications

The main goal of this work is to fathom the suitability of the mesh with multiple broadcasting architecture (MMB) for some tree-related computations. We view our contribution at two levels: on the one hand, we exhibit time lower bounds for a number of tree-related problems on the MMB. On the other hand, we show that these lower bounds are tight by exhibiting time-optimal tree algorithms on the MMB. Specifically, we show that the task of encoding and/or decoding n-node binary and ordered trees cannot be solved faster than Ω(log n) time even if the MMB has an infinite …

Dynamics And Control Of A Three Dimensional Gantry Crane With Cable Flexibility, Uchendu H. Eke

Mechanical & Aerospace Engineering Theses & Dissertations

The control of payload swing in industrial gantry cranes is a topic of widespread interest. In this thesis, the control of the swing of a payload idealized by a point mass assumption is investigated utilizing s, compact robotics matrix/vector representation of the dynamical model. In this form, this particular system can be viewed as sn underactuated manipulator with equal numbers of active and passive degrees of freedom. The full three dimensional model is developed and linearized by modelling the cable as a single thread of fiexible wire and the degree of dynamic coupling between the active and passive coordinates is …

A Study Of The Numerical Implementation Of Multidisciplinary Design Optimization Strategies, Rodney A. Taylor

Mechanical & Aerospace Engineering Theses & Dissertations

Design optimization provides an organized, systematic, and efficient method for obtaining design improvements based upon a specified measure of design performance. In the multidisciplinary design optimization (MDO) environment efficient optimization techniques allow complex designs to be improved by managing conflicting disciplinary design goals so as to improve the global design. This thesis studies the implementation issues surrounding MDO techniques and strategies. To facilitate this investigation two testbed problems have been selected for study. These problems consider two approaches to the conceptual design of an aeroelastic wing. The first approach is based on an idealized, two-dimensional representation of an airfoil under …

Effects Of Vascularization On Lymphocyte/Tumor Cell Dynamics: Qualitative Features, J. A. Adam

Mathematics & Statistics Faculty Publications

By adapting a pre-existing model to include the effects of vascularization within a tumor or multicell spheroid, a predator-prey system describing the cell populations of a solid tumor and reactive lymphocytes is formulated. The paper serves as a review of the minimal deterministic approach to tumor-host immune system interactions while examining, in a qualitative manner, the modifications to the dynamics induced by a simple representation of the vascularized tumor. In addition, the possibility of limit-cycle behavior is studied by regarding each of six parameters present in the model as a bifurcation parameter. Thus, in principle, well-defined and periodic oscillations in …

Data Compression Based On The Cubic B-Spline Wavelet With Uniform Two-Scale Relation, S. K. Yang, C. H. Cooke

Mathematics & Statistics Faculty Publications

The aim of this paper is to investigate the potential artificial compression which can be achieved using an interval multiresolution analysis based on a semiorthogonal cubic B-spline wavelet. The Chui-Quak [1] spline multiresolution analysis for the finite interval has been modified [2] so as to be characterized by natural spline projection and uniform two-scale relation. Strengths and weaknesses of the semiorthogonal wavelet as regards artificial compression and data smoothing by the method of thresholding wavelet coefficients are indicated.

Superconvergence Of The Iterated Galerkin Methods For Hammerstein Equations, Hideaki Kaneko, Yuesheng Xu

Mathematics & Statistics Faculty Publications

In this paper, the well-known iterated Galerkin method and iterated Galerkin-Kantorovich regularization method for approximating the solution of Fredholm integral equations of the second kind are generalized to Hammerstein equations with smooth and weakly singular kernels. The order of convergence of the Galerkin method and those of superconvergence of the iterated methods are analyzed. Numerical examples are presented to illustrate the superconvergence of the iterated Galerkin approximation for Hammerstein equations with weakly singular kernels. © 1996, Society for Industrial and Applied Mathematics

An Efficient Runge-Kutta (4,5) Pair, P. Bogacki, L. F. Shampine

Mathematics & Statistics Faculty Publications

A pair of explicit Runge-Kutta formulas of orders 4 and 5 is derived. It is significantly more efficient than the Fehlberg and Dormand-Prince pairs, and by standard measures it is of at least as high quality. There are two independent estimates of the local error. The local error of the interpolant is, to leading order, a problem-independent function of the local error at the end of the step.

Parallel Newton-Krylov-Schwarz Solvers For The Full Potential Flow Equation, Jie Zhang

Computer Science Theses & Dissertations

Newton-Krylov-Schwarz methods are increasingly applied in Computational Fluid Dynamics (CFD). We develop a parallel analysis code based on this method for the full potential flow model. The full potential model consists of a single nonlinear second-order partial differential equation of mixed type (elliptic/hyperbolic), which we solve as a steady boundary-value problem.

We use a nine-point finite-difference stencil to discretize the equation. A Newtonlike linearization and correction method is used to solve the resulting set of nonlinear algebraic equations. To solve the inner linear equations, we employ a Krylov space method. Preconditioners are used to improve the convergence rate. In order …