Hasil Pencarian  ::  Simpan CSV :: Kembali

"This book deals with the application of density matrix theory to atomic and molecular physics. The aim is to precisely characterize sates by a vector and to construct general formulas and proofs of general theorems. The basic concepts and quantum mechanical fundamentals (reduced density matrices, entanglement, quantum correlations) are discussed in a comprehensive way. The discussion leads up to applications like coherence and orientation effects in atoms and molecules, decoherence and relaxation processes. This third edition has been updated and extended throughout and contains a completely new chapter exploring nonseparability and entanglement in two-particle spin-1/2 systems. The text discusses recent studies in atomic and molecular reactions. A new chapter explores nonseparability and entanglement in two-particle spin-1/2 systems."

"Sebuah graf dengan simpul dapat direpresentasikan sebagai matriks simetris berukuran nxn seperti matriks ketetanggaan dan laplacian. Matriks simetris dijamin oleh teorema spektral, memiliki nilai eigen lengkap (ruang eigen setara dengan R^n). Hal ini memberikan kemungkinan untuk menelaah sifat graf dengan menggunakan nilai eigen dan vektor eigen matriks ketetanggaan dan laplacian. Himpunan nilai eigen beserta multiplisitasnya disebut sebagai spektrum. Pada skripsi ini dibahas tentang sifat dari spektrum matriks ketetanggaan dari graf teratur yang diasosiasikan pada nilai eigen terbesarnya serta sifat dari spektrum matriks laplacian dari graf teratur yang diasosiasikan pada rata-rata nilai eigen. Selanjutnya, juga dibahas keterhubungan antara spektrum matriks laplacian dan ketetanggaan pada graf reguler.

---

A graph with vertices can be represented as a symmetric matrix of size nxn, such as an adjacency matrix and Laplacian matrix. Symmetric matrices, guaranteed by the spectral theorem, have a complete eigenvalue (eigenspace equal to R^n). This provides ways to learn graphs using eigenvalues and eigenvectors of their adjacency and laplacian matrices. A spectrum is a set of eigenvalues together with their multiplisities. This thesis discuss the properties of the spectrum of the adjacency matrix of regular graphs associated with their largest eigenvalue, as well as the properties of the spectrum of the Laplacian matrix of regular graphs associated with the average eigenvalue. Subsequently, the interrelation between the spectra of the laplacian and adjacency matrices in regular graphs will be examined."

"This unique book addresses advanced linear algebra from a perspective in which invariant subspaces are the central notion and main tool. It contains comprehensive coverage of geometrical, algebraic, topological, and analytic properties of invariant subspaces. The text lays clear mathematical foundations for linear systems theory and contains a thorough treatment of analytic perturbation theory for matrix functions."