• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 181
  • 32
  • 13
  • 10
  • 6
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 292
  • 83
  • 50
  • 49
  • 44
  • 39
  • 39
  • 33
  • 32
  • 30
  • 27
  • 24
  • 24
  • 24
  • 23
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

Eigenvalue analysis of amorphous solids consisting of frictional grains under athermal quasistatic shear / 非熱的準静的剪断下での摩擦のある粒子からなるアモルファス固体の固有値解析

Ishima, Daisuke 23 March 2023 (has links)
京都大学 / 新制・課程博士 / 博士(理学) / 甲第24397号 / 理博第4896号 / 新制||理||1699(附属図書館) / 京都大学大学院理学研究科物理学・宇宙物理学専攻 / (主査)教授 早川 尚男, 教授 佐々 真一, 准教授 藤 定義 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DFAM
42

Topics on the Spectral Theory of Automorphic Forms

Belt, Dustin David 12 July 2006 (has links) (PDF)
We study the analytic properties of the Eisenstein Series of $frac {1}{2}$-integral weight associated with the Hecke congruence subgroup $Gamma_0(4)$. Using these properties we obtain asymptotics for sums of certain Dirichlet $L$-series. We also obtain a formula reducing the study of Selberg's Eigenvalue Conjecture to the study of the nonvanishing of the Eisenstein Series $E(z,s)$ for Hecke congruence subgroups $Gamma_0(N)$ at $s=frac {1+i}{2}$.
43

The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs

Kempton, Mark Condie 11 June 2010 (has links) (PDF)
For a graph G we define S(G) to be the set of all real symmetric n by n matrices whose off-diagonal zero/nonzero pattern is described by G. We show how to compute the minimum rank of all matrices in S(G) for a class of graphs called outerplanar graphs. In addition, we obtain results on the possible eigenvalues and possible inertias of matrices in S(G) for certain classes of graph G. We also obtain results concerning the relationship between two graph parameters, the zero forcing number and the path cover number, related to the minimum rank problem.
44

On the Numerical Range of Compact Operators

Dabkowski, Montserrat 01 June 2022 (has links) (PDF)
One of the many characterizations of compact operators is as linear operators whichcan be closely approximated by bounded finite rank operators (theorem 25). It iswell known that the numerical range of a bounded operator on a finite dimensionalHilbert space is closed (theorem 54). In this thesis we explore how close to beingclosed the numerical range of a compact operator is (theorem 56). We also describehow limited the difference between the closure and the numerical range of a compactoperator can be (theorem 58). To aid in our exploration of the numerical range ofa compact operator we spend some time examining its spectra, as the spectrum of abounded operator is closely tied to its numerical range (theorem 45). Throughout,we use the forward shift operator and the diagonal operator (example 1) to illustratethe exceptional behavior of compact operators.
45

The Performance of SLNR Beamformers in Multi-User MIMO Systems

Hameed, Khalid W.H., Abdulkhaleq, Ahmed M., Al-Yasir, Yasir I.A., Ojaroudi Parchin, Naser, Rayit, A., Al Khambashi, M., Abd-Alhameed, Raed, Noras, James M. 22 August 2018 (has links)
Yes / Beamforming in multi-user MIMO (MU-MIMO) systems is a vital part of modern wireless communication systems. Researchers looking for best operational performance normally optimize the problem and then solve for best weight solutions. The weight optimization problem contains variables in numerator and dominator: this leads to so-called variable coupling, making the problem hard to solve. Formulating the optimization in terms of the signal to leakage and noise ratio (SLNR) helps in decoupling the problem variables. In this paper we study the performance of the SLNR with variable numbers of users and handset antennas. The results show that there is an optimum and the capacity curve is a concave over these two parameters. The performances of two further variations of this method are also considered.
46

Computing the Effective Hamiltonian in the Majda-Souganidis Model

Cara, Mirela 04 1900 (has links)
<p> In premixed turbulent combustion, the normal speed of propagation of the flame front is enhanced by the turbulent velocity field. This project will focus on the method of computing the normal speed of propagation of the flame front in the Majda-Souganidis model of turbulent combustion. Solving this problem involves computing the eigenvalue of a nonlinear cell problem. Discussed in this thesis is a new, simple and direct numerical method for approximating the eigenvalue, also called the effective Hamiltonian.</p> / Thesis / Master of Science (MSc)
47

Eigenvalue Statistics for Random Block Operators

Schmidt, Daniel F. 28 April 2015 (has links)
The Schrodinger Hamiltonian for a single electron in a crystalline solid with independent, identically distributed (i.i.d.) single-site potentials has been well studied. It has the form of a diagonal potential energy operator, which contains the random variables, plus a kinetic energy operator, which is deterministic. In the less-understood cases of multiple interacting charge carriers, or of correlated random variables, the Hamiltonian can take the form of a random block-diagonal operator, plus the usual kinetic energy term. Thus, it is of interest to understand the eigenvalue statistics for such operators. In this work, we establish a criterion under which certain random block operators will be guaranteed to satisfy Wegner, Minami, and higher-order estimates. This criterion is phrased in terms of properties of individual blocks of the Hamiltonian. We will then verify the input conditions of this criterion for a certain quasiparticle model with i.i.d. single-site potentials. Next, we will present a progress report on a project to verify the same input conditions for a class of one-dimensional, single-particle alloy-type models. These two results should be sufficient to demonstrate the utility of the criterion as a method of proving Wegner and Minami estimates for random block operators. / Ph. D.
48

Thermomechanical and Vibration Analysis of Stiffened Unitized Structures and Threaded Fasteners

Devarajan, Balakrishnan 01 February 2019 (has links)
This dissertation discusses the thermomechanical analyses performed on threaded fasteners and curvilinearly stiffened composite panels with internal cutouts. The former problem was analyzed using a global/local approach using the commercial finite element software ANSYS while a fully functional code using isogeometric analysis was developed from scratch for the latter. For the threaded fasteners, a global simplified 3D model is built to evaluate the deformation of the structure. A second local model reproducing accurately the threads of the fasteners is used for the accurate assessment of the stresses in the vicinity of the fasteners. The isogeometric analysis code, capable of performing static, buckling and vibration analysis on stiffened composite plates with cutouts using single patch, multiple patches and level set methods is then discussed. A novel way to achieve displacement compatibility between the panel and stiffeners interfaces is introduced. An easy way of modeling plates with complicated cutouts by using edge curves and generating a ruled NURBS surface between them is described. Influence on the critical thermal buckling load and the fundamental mode of vibration due to the presence of circular, elliptical and complicated cutouts is also investigated. Results of parametric studies are presented which show the influence of ply orientation, size and orientation of the cutout, and the position and profile of the curvilinear stiffener. The numerical examples show high reliability and efficiency when compared with other published solutions and those obtained using ABAQUS, a commercial software. / PHD / Aircraft in flight are subjected to different loads due to maneuvers and gust; there external forces cause internal loads and depend on the location of the panel in the aircraft. The internal loads, may result in the buckling of the panel. Hence, there is a need for studying structural efficiency and develop strong and stiff lightweight structures. Stiffened composite panels is a technology capable of addressing these needs. However, when used in space vehicles moving at hypersonic speeds, such structures experience significant temperature rise in a very short time resulting from the aerodynamic heating due to friction between the vehicle surface and the atmosphere. Such phenomena is more prominent during reentry and launch processes. Hence, it is really important to consider thermal effects while designing and analyzing such structures. Composite stiffened panels have many advantages like small manufacturing cost, high stability, great energy absorption, superior damage tolerance etc. One of the main failure modes for stiffened composite panels is thermal buckling. An extensive literature review on thermal buckling of stiffened composite panels was conducted in this dissertation. Thermal buckling and vibration analysis as well as a parametric study of a stiffened composite panel with internal cutouts was conducted, and verified using ABAQUS, a Finite Element Software.
49

Rational Interpolation Methods for Nonlinear Eigenvalue Problems

Brennan, Michael C. 27 August 2018 (has links)
This thesis investigates the numerical treatment of nonlinear eigenvalue problems. These problems are defined by the condition $T(lambda) v = boldsymbol{0}$, with $T: C to C^{n times n}$, where we seek to compute the scalar-vector pairs, $lambda in C$ and nonzero $ v in C^{n}$. The first contribution of this work connects recent contour integration methods to the theory and practice of system identification. This observation leads us to explore rational interpolation for system realization, producing a Loewner matrix contour integration technique. The second development of this work studies the application of rational interpolation to the function $T(z)^{-1}$, where we use the poles of this interpolant to approximate the eigenvalues of $T$. We then expand this idea to several iterative methods, where at each step the approximate eigenvalues are taken as new interpolation points. We show that the case where one interpolation point is used is theoretically equivalent to Newton's method for a particular scalar function. / Master of Science / This thesis investigates the numerical treatment of nonlinear eigenvalue problems. The solutions to these problems often reveal characteristics of an underlying physical system. One popular methodology for handling these problems uses contour integrals to compute a set of the solutions. The first contribution of this work connects these contour integration methods to the theory and practice of system identification. This leads us to explore other techniques for system identification, resulting in a new method. Another common methodology approximates the nonlinear problem directly. The second development of this work studies the application of rational interpolation for this purpose. We then use this idea to form several iterative methods, where at each step the approximate solutions are taken to be new interpolation points. We show that the case where one interpolation point is used is theoretically equivalent to Newton’s method for a particular scalar function.
50

Parallel implementation of Davidson-type methods for large-scale eigenvalue problems

Romero Alcalde, Eloy 17 April 2012 (has links)
El problema de valores propios (tambien llamado de autovalores, o eigenvalues) esta presente en diversas tareas cienficas a traves de la resolucion de ecuaciones diferenciales, analisis de modelos y calculos de funciones matriciales, entre otras muchas aplicaciones. Si los problemas son de dimension moderada (menor a 106), pueden ser abordados mediante los llamados metodos directos, como el algoritmo iterativo QR o el metodo de divide y vencerlas. Sin embargo, si el problema es de gran dimension y solo se requieren unas pocas soluciones (comparado con el tama~no del problema) y con un cierto grado de aproximacion, los metodos iterativos pueden resultar mas eficientes. Ademas los metodos iterativos pueden ofrecer mejores prestaciones en arquitecturas de altas prestaciones, como las de memoria distribuida, en las que existen un cierto numero de nodos computacionales con espacio de memoria propios y solo pueden compartir informacion y sincronizarse mediante el paso de mensajes. Esta tesis aborda la implementacion de metodos de tipo Davidson, destacando Generalized Davidson y Jacobi-Davidson, una clase de metodos iterativos que puede ser competitiva en casos especialmente dificiles como calcular valores propios en el interior del espectro o cuando la factorizacion de matrices es prohibitiva o ineficiente, y solo es posible una factorizacion aproximada. La implementacion se desarrolla en SLEPc (Scalable Library for Eigenvalue Problem Computations), libreria libre destacada en la resolucion de problemas de gran tama~no de valores propios, problemas cuadraticos de valores propios y problemas de valores singulares, entre otros. A su vez, SLEPc se desarrolla bajo el marco de PETSc (Portable, Extensible Toolkit for Scientic Computation), que ofrece implementaciones eficientes de operaciones basicas del algebra lineal, como operaciones con matrices y vectores, resolucion aproximada de sistemas lineales, factorizaciones exactas y aproximadas de matrices, etc. / Romero Alcalde, E. (2012). Parallel implementation of Davidson-type methods for large-scale eigenvalue problems [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/15188

Page generated in 0.3145 seconds