The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by the size of a maximal bipartite minor.

In this work we deal with conversion of 3D triagonal polygonal meshes to the 3D spline patches using spectral analysis. The converted mesh is divided into quadrilaterals using eigenvectors of Laplacian operator. These quadrilaterals will be converted into spline patches. We will present some interesting results of this method. The assets and imperfections of this method will be briefly discussed.

No description available.

We consider random symmetric Toeplitz matrices of size n. Assuming that the entries on the diagonals are independent centered random variables with finite γ-th moment (γ>2), a law of large numbers is established for the largest eigenvalue. Following the approach of Sen and Virág (2013), in the limit of large n, the largest rescaled eigenvalue is shown to converge to the limit 0.8288... . The background theory is explained and some symmetry results on the eigenvectors of the Toeplitz matrix and an auxiliary matrix are presented. A numerical investigation illustrates the rate of convergence and the oscillatory nature of the eigenvectors of the Toeplitz matrix. Finally, the possibility of proving a limiting distribution for the largest eigenvalue is discussed, and suggestions for future research are made. / Vi betraktar stokastiska Toeplitz-matriser av storlek n. Givet att elementen på diagonalerna är oberoende, centrerade stokastiska variabler med ändligt γ-moment (γ>2), fastställer vi ett stora talens lag för det största egenvärdet. Med metoden från Sen och Virág (2013) visar vi att det största omskalade egenvärdet konvergera mot gränsen 0.8288... . Bakgrundsteorin förklaras och några symmetriresultat för Toeplitz-matrisens egenvektorer presenteras. En numerisk undersökning illustrerar konvergenshastigheten och Toeplitz-matrisens egenvektorers periodiska natur. Slutligen diskuteras möjligheten att bevisa en asymptotisk fördelning för de största egenvärderna och förslag för fortsatt forskning läggs fram.

The current state-of-the-art tyre models tend to be demanding in parameterisation terms, typically requiring extensive and expensive testing, and computational power. Consequently, an alternative parameterisation approach, which also allows for the separation of model fidelity from computational demand, is essential. Based on the above, a tyre model is introduced in this work. Tyre motion is separated into two components, the first being the non-linear global motion of the tyre as a rigid body and the second being the linear local deformation of each node. The resulting system of differential equations of motion consists of a reduced number of equations, depending on the number of rigid and elastic modes considered rather than the degrees of freedom. These equations are populated by the eigenvectors and the eigenvalues of the elastic tyre modes, the eigenvectors corresponding to the rigid tyre modes and the inertia properties of the tyre. The contact sub-model consists of bristles attached to each belt node. Shear forces generated in the contact area are calculated by a distributed LuGre friction model while vertical tread dynamics are obtained by the vertical motion of the contact nodes and the corresponding bristle stiffness and damping characteristics. To populate the abovementioned system of differential equations, the modal properties of the rigid and the elastic belt modes are required. In the context of the present work, rigid belt modes are calculated analytically, while in-plane and out-of-plane elastic belt modes are identified experimentally by performing modal testing on the physical tyre. To this end, the eigenvalue of any particular mode is obtained by fitting a rational fraction polynomial expression to frequency response data surrounding that mode. The eigenvector calculation requires a different approach as typically modes located in the vicinity of the examined mode have an effect on the apparent residue. Consequently, an alternative method has been developed which takes into account the out-of-band modes leading to identified residues representing only the modes of interest. The validation of the proposed modelling approach is performed by comparing simulation results to experimental data and trends found in the literature. In terms of vertical stiffness, correlation with experimental data is achieved for a limited vertical load range, due to the nature of the identified modal properties. Moreover, the tyre model response to transient lateral slip is investigated for a range of longitudinal speeds and vertical loads, and the resulting relaxation length trends are compared with the relevant literature.

We show that amongst all trees with a given degree sequence it is a ball where the vertex degrees decrease with increasing distance from its center that maximizes the spectral radius of the graph (i.e., its adjacency matrix). The resulting Perron vector is decreasing on every path starting from the center of this ball. This result it also connected to Faber-Krahn like theorems for Dirichlet matrices on trees. The above result is extended to connected graphs with given degree sequence. Here we give a necessary condition for a graph that has greatest maximum eigenvalue. Moreover, we show that the greatest maximum eigenvalue is monotone on degree sequences with respect to majorization. (author's abstract). Note: There is a more recent version of this paper available: "Graphs with Given Degree Sequence and Maximal Spectral Radius", Research Report Series / Department of Statistics and Mathematics, no. 72. / Series: Research Report Series / Department of Statistics and Mathematics

No description available.

A well-known result in spectral graph theory states that if a graph has an equitable partition then the eigenvalues of the associated divisor graph are a subset of the graph's eigenvalues. A natural question question is whether it is possible to recover the remaining eigenvalues of the graph. Here we show that if a graph has a Hermitian adjacency matrix then the spectrum of the graph can be decomposed into a collection of smaller graphs whose eigenvalues are collectively the remaining eigenvalues of the graph. This we refer to as a complete equitable decomposition of the graph.

Studies of numerical methods to decouple structure and fluid interaction have reported the need for more precise approximations of higher structure eigenvalues and eigenvectors than are currently available from standard finite elements. The purpose of this study is to investigate hybrid finite element models composed of standard finite elements and exact-elements for the prediction of higher structure eigenvalues and eigenvectors. An exact beam-element dynamic-stiffness formulation is presented for a plane Timoshenko beam with rotatory inertia. This formulation is based on a converted continuum transfer matrix and is incorporated into a typical finite element program for eigenvalue/vector problems. Hybrid models using the exact-beam element generate transcendental, nonlinear eigenvalue problems. An eigenvalue extraction technique for this problem is also implemented. Also presented is a post-processing capability to reconstruct the mode shape each of exact element at as many discrete locations along the element as desired. The resulting code has advantages over both the standard transfer matrix method and the standard finite element method. The advantage over the transfer matrix method is that complicated structures may be modeled with the converted continuum transfer matrix without having to use branching techniques. The advantage over the finite element method is that fewer degrees of freedom are necessary to obtain good approximations for the higher eigenvalues. The reduction is achieved because the incorporation of an exact-beam-element is tantamount to the dynamic condensation of an infinity of degrees of freedom. Numerical examples are used to illustrate the advantages of this method. First, the eigenvalues of a fixed-fixed beam are found with purely finite element models, purely exact-element models, and a closed-form solution. Comparisons show that purely exact-element models give, for all practical purposes, the same eigenvalues as a closed-form solution. Next, a Portal Arch and a Verdeel Truss structure are modeled with hybrid models, purely finite element, and purely exact-element models. The hybrid models do provide precise higher eigenvalues with fewer degrees of freedom than the purely finite element models. The purely exact-element models were the most economical for obtaining higher structure eigenvalues. The hybrid models were more costly than the purely exact-element models, but not as costly as the purely finite element models. / Ph. D.

Submitted by Erika Demachki (erikademachki@gmail.com) on 2014-10-01T10:43:24Z No. of bitstreams: 2 TCC 30_06_2013 Marco Aurélio PROFMAT.pdf: 3494241 bytes, checksum: 199c5af10fd068461af3db98f96eaf49 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Cláudia Bueno (claudiamoura18@gmail.com) on 2014-10-31T19:45:56Z (GMT) No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) TCC 30_06_2013 Marco Aurélio PROFMAT.pdf: 3494241 bytes, checksum: 199c5af10fd068461af3db98f96eaf49 (MD5) / Made available in DSpace on 2014-10-31T19:45:56Z (GMT). No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) TCC 30_06_2013 Marco Aurélio PROFMAT.pdf: 3494241 bytes, checksum: 199c5af10fd068461af3db98f96eaf49 (MD5) Previous issue date: 2013-04-12 / In this thesis we study linear transformations, eigenvalues and eigenvectors with the objective of solve a system of linear ordinary differential equations with constant coefficients. / Nesta dissertação estudamos transformações lineares, autovalores e autovetores com o intuito de resolvermos um sistema de equações diferenciais ordinárias lineares com coeficientes constantes.