Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 728 dari 34197, Total: 341964 data)

k Workers in a Circular Warehouse: A Random Walk on a Circle, without Passing

Nama Pengarang : PC. S. Sutisno
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 2)
Nomor Halaman : 301-314
Abstraksi Narasi : We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a hyperplane (with boundaries). By expressing positions via a moving reference frame, the geometry of the no-passing criteria is greatly simplified, with the resultant condition expressible as the coordinate system planes which bound the first orthant. To determine state transition probabilities, we decompose transitions into independent events and construct a digraph representation in which calculating transition probability is reduced to a shortest path determination on the digraph. The resultant decomposition digraph is self-converse, and we exploit that property to establish the necessary symmetries to find the stationary density for the process.

Iterated Impact Dynamics of N-Beads on a Ring

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 2)
Nomor Halaman : 273-300
Abstraksi Narasi : When N-beads slide along a frictionless hoop, their collision sequence gives rise to a dynamical system that can be studied via matrix products. It is of general interest to understand the distribution of velocities and the corresponding eigenvalue spectrum that a given collision sequence can produce. We formulate the problem for general N and state some basic theorems regarding the eigenvalues of the collision matrices and their products. The case of three beads of masses m1, m2, m3 is studied in detail. We exploit the fact that each collision sequence can be viewed as a billiard trajectory in a right triangle with non-standard reflection rules. Existence of families of periodic orbits are proven, and orbits that densely fill the triangle are computed. Eigenvalue distributions and position and velocity histograms are computed as a function of the restitution coefficient, both periodic and dense collision sequences are discussed, and a series of conjectures based on computational evidence are formulated. Comparisons are made between the eigenvalue distributions and autocorrelation matrices associated with dense trajectories generated from a chaotic collision sequence and spectra from matrix sequences generated from random orderings, and we describe how the three-bead system could be used as the basis for a random number generating algorithm that is computationally efficient.

On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods

Nama Pengarang : Valeria Simoncini
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 2)
Nomor Halaman : 247-272
Abstraksi Narasi : Krylov subspace methods often exhibit superlinear convergence. We present a general analytic model which describes this superlinear convergence, when it occurs. We take an invariant subspace approach, so that our results apply also to inexact methods, and to nondiagonalizable matrices. Thus, we provide a unified treatment of the superlinear convergence of GMRES, conjugate gradients, block versions of these, and inexact subspace methods. Numerical experiments illustrate the bounds obtained.

Propagation, Observation, and Control of Waves Approximated by Finite Difference Methods

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 2)
Nomor Halaman : 197-243
Abstraksi Narasi : This paper surveys several topics related to the observation and control of wave propagation phenomena modeled by finite difference methods. The main focus is on the property of observability, corresponding to the question of whether the total energy of solutions can be estimated from partial measurements on a subregion of the domain or boundary. The mathematically equivalent property of controllability corresponds to the question of whether wave propagation behavior can be controlled using forcing terms on that subregion, as is often desired in engineering applications. Observability/controllability of the continuous wave equation is well understood for the scalar linear constant coefficient case that is the focus of this paper. However, when the wave equation is discretized by finite difference methods, the control for the discretized model does not necessarily yield a good approximation to the control for the original continuous problem. In other words, the classical convergence (consistency + stability) property of a numerical scheme does not suffice to guarantee its suitability for providing good approximations to the controls that might be needed in applications. Observability/controllability may be lost under numerical discretization as the mesh size tends to zero due to the existence of high-frequency spurious solutions for which the group velocity vanishes. This phenomenon is analyzed and several remedies are suggested, including filtering, Tychonoff regularization, multigrid methods, and mixed finite element methods. We also briefly discuss these issues for the heat, beam, and Schrödinger equations to illustrate that diffusive and dispersive effects may help to retain the observability/controllability properties at the discrete level. We conclude with a list of open problems and future subjects for research.

A Survey of Eigenvector Methods for Web Information Retrieval

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 1)
Nomor Halaman : 135-161
Abstraksi Narasi : Web information retrieval is significantly more challenging than traditional well-controlled, small document collection information retrieval. One main difference between traditional information retrieval and Web information retrieval is the Web's hyperlink structure. This structure has been exploited by several of today's leading Web search engines, particularly Google and Teoma. In this survey paper, we focus on Web information retrieval methods that use eigenvector computations, presenting the three popular methods of HITS, PageRank, and SALSA.

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 1)
Nomor Halaman : 99-131
Abstraksi Narasi : Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available and that the constraint gradients are sparse. Second derivatives are assumed to be unavailable or too expensive to calculate. We discuss an SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems. The Hessian of the Lagrangian is approximated using a limited-memory quasi-Newton method. SNOPT is a particular implementation that uses a reduced-Hessian semidefinite QP solver (SQOPT) for the QP subproblems. It is designed for problems with many thousands of constraints and variables but is best suited for problems with a moderate number of degrees of freedom (say, up to 2000). Numerical results are given for most of the CUTEr and COPS test collections (about 1020 examples of all sizes up to 40000 constraints and variables, and up to 20000 degrees of freedom).

A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 1)
Nomor Halaman : 67-95
Abstraksi Narasi : A new method is presented for distributing data in sparse matrix-vector multiplication. The method is two-dimensional, tries to minimize the true communication volume, and also tries to spread the computation and communication work evenly over the processors. The method starts with a recursive bipartitioning of the sparse matrix, each time splitting a rectangular matrix into two parts with a nearly equal number of nonzeros. The communication volume caused by the split is minimized. After the matrix partitioning, the input and output vectors are partitioned with the objective of minimizing the maximum communication volume per processor. Experimental results of our implementation, Mondriaan, for a set of sparse test matrices show a reduction in communication volume compared to one-dimensional methods, and in general a good balance in the communication work. Experimental timings of an actual parallel sparse matrix-vector multiplication on an SGI Origin 3800 computer show that a sufficiently large reduction in communication volume leads to savings in execution time.

On the Finite Element Solution of the Pure Neumann Problem

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 1)
Nomor Halaman : 50-66
Abstraksi Narasi : This paper considers the finite element approximation and algebraic solution of the pure Neumann problem. Our goal is to present a concise variational framework for the finite element solution of the Neumann problem that focuses on the interplay between the algebraic and variational problems. While many of the results that stem from our analysis are known by some experts, they are seldom derived in a rigorous fashion and remain part of numerical folklore. As a result, this knowledge is not accessible (or appreciated) by many practitioners---both novices and experts---in one source. Our paper contributes a simple, yet insightful link between the continuous and algebraic variational forms that will prove useful.

Bouncing Ball Modes and Quantum Chaos

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 1)
Nomor Halaman : 43-49
Abstraksi Narasi : Quantum ergodicity for classically chaotic systems has been studied extensively both theoretically and experimentally in mathematics and physics. Despite this long tradition we are able to prove a new rigorous result using only elementary calculus. In the case of the famous Bunimovich stadium shown in Figure 1, we prove that the wave functions have to spread to any neighborhood of the wings.

Product Eigenvalue Problems

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 47 (No. 1)
Nomor Halaman : 3-40
Abstraksi Narasi : Many eigenvalue problems are most naturally viewed as product eigenvalue problems. The eigenvalues of a matrix A are wanted, but A is not given explicitly. Instead it is presented as a product of several factors: . Usually more accurate results are obtained by working with the factors rather than forming A explicitly. For example, if we want eigenvalues/vectors of , it is better to work directly with B and not compute the product. The intent of this paperis to demonstrate that the product eigenvalue problem is a powerful unifying concept. Diverse examples of eigenvalue problems are discussed and formulated as product eigenvalue problems. For all but a couple of these examples it is shown that the standard algorithms for solving them are instances of a generic  algorithm applied to a related cyclic matrix.
← Kembali ke Halaman Utama