We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Chapter 4 starts out with a physics motivation, as well as a mathematical statement of the problems that will be tackled in later sections. An extensive section discusses the conditioning of linear-algebra problems: borrowing ideas and examples from matrix perturbation theory, this teaches students what to look out for. Roughly half of the remaining chapter is dedicated to the solution of linear systems of equations, employing methods of varying sophistication: Gaussian elimination, LU decomposiion, pivoting, and the Jacobi iterative method. The second half addresses the eigenvalue problem, again with a variety of methods, including the power method, eigenvalue shifting, and the QR method. Crucially, this includes explicit mathematical derivations of these approaches. A brief introduction to the singular value decomposition is also given, including both an existence proof and a programming implementation. The chapter is rounded out by an extensive physics project, which studies the eigenvalue problem of interacting spins, and a problem set. The physics project patiently builds up matrix quantum mechanics, allowing students to tackle problems of increasing difficulty.
We introduce the spectral radius of a matrix, and study how it relates to induced matrix norms. We prove Gelfand’s theorem on the spectral radius. We introduce the condition number of a matrix, and use it to provide error estimates for the solution of a linear system under perturbations.
Mathematical background and formulation of numerical minimization process are described in terms of gradient-based methods, whose ingredients include gradient, Hessian, directional derivatives, optimality conditions for minimization, Hessian eigensystem, conjugate number of Hessian, and conjugate vectors. Various minimization algorithms, such as the steepest descent method, Newton’s method, conjugate gradient method, and quasi-Newton’s method, are introduced along with practical examples.
Computational linear algebra builds on the methods in Part I for solving systems of linear algebraic equations and the algebraic eigenproblem appropriate for small systems to methods amenable to approximate computer solutions for large systems.These include direct and iterative methods for solving systems of equations, such as LU decomposition and Gauss-Seidel iteration.A popular algorithm based on QR decomposition is described for solving large algebraic eigenproblems for the full spectrum of eigenpairs, and the Arnoldi method for a subset of eigenpairs of sparse matrices.
This chapter bounds the condition numbers of thestiffness matrix of operator-adapted wavelets within each subband (scale). These resulting bounds are characterized through weak alignment conditions between measurement functions and eigensubspaces of the underlying operator. In Sobolev spaces, these alignment conditions translate into approximate error estimates associated with variational splines andscattered data approximation. These estimates are established for the three primary examples, subsampled Diracs, Haar prewavelets, and local polynomials,of hierarchies of measurement functions in Sobolev spaces.
Some optimal choices for a parameter of the Dai–Liao conjugate gradient method are proposed by conducting matrix analyses of the method. More precisely, first the $\ell _{1}$ and $\ell _{\infty }$ norm condition numbers of the search direction matrix are minimized, yielding two adaptive choices for the Dai–Liao parameter. Then we show that a recent formula for computing this parameter which guarantees the descent property can be considered as a minimizer of the spectral condition number as well as the well-known measure function for a symmetrized version of the search direction matrix. Brief convergence analyses are also carried out. Finally, some numerical experiments on a set of test problems related to constrained and unconstrained testing environment, are conducted using a well-known performance profile.
In contrast to general industrial robots, which are operated in normal environments and are easily accessible by human workers, telemanipulators are typically designed to perform specific and extreme tasks in hazardous areas. Teleoperation systems are difficult-to-equip fully intuitive or automated control systems because these are the kinds of manipulator systems used as substitutes to perform tasks that humans have to guide directly because they may require tough, sensitive, or sophisticated handling motions. Basically, these kinds of tasks are difficult to remotely perform through a slave manipulator operated by a human unless modification and optimization of the system are conducted. In this regard, the target system dealt within this study has similar disadvantages even though it has a high degree of freedom (DOF) arm structure. The performance of the current system was quantitatively evaluated to optimize the structure according to the considered main tasks. This work presents the various performance indices utilized and analyzes the current design of the considered telemanipulator system. An optimal design approach using the parameters associated with the frequent motions of the considered 6-DOF telemanipulator is then proposed based on the conducted analyses.
An increasing number of reference stations have been established, leading to a sharp increase in the workload of Double-Difference (DD) baseline solutions, which are not appropriate for the integrated processing of denser networks. Correlations among the ambiguities in DD models are complex, and it is difficult to get precise solutions. This paper improves the DD ambiguity resolution performance over a long baseline, using a modified strategy based on an Un-Differenced (UD) and Un-Combined (UC) model. The satellite clocks are estimated as parameters, which are properly constrained by real-time satellite clock products for improving the smoothness of ambiguities. We use data from the Earth Scope Plate Boundary Observatory to examine the presented method in Global Positioning System (GPS) networks. Our method obtained more obviously centralised distributions. The successful fixed rate was 96·4% for the DD baseline solution, and 98·4% for the UD method. The proposed strategy is appropriate for the distributed architecture of extensive systems and avoids a heavy computational burden.
This paper investigates the kinematics of one new isoconstrained parallel manipulator with Schoenflies motion. This new manipulator has four degrees of freedom and two identical limbs, each having the topology of Cylindrical–Revolute–Prismatic–Helical (C–R–P–H). The kinematic equations are derived in closed-form using matrix algebra. The Jacobian matrix is then established and the singularities of the robot are investigated. The reachable workspaces and condition number of the manipulator are further studied. From the kinematic analysis, it can be shown that the manipulator is simple not only for its construction but also for its control. It is hoped that the results of the evaluation of the two-limb parallel mechanism can be useful for possible applications in industry where a pick-and-place motion is required.
Nonlocal diffusion models involve integral equations that account for nonlocal interactions and do not explicitly employ differential operators in the space variables. Due to the nonlocality they might look different from classical partial differential equation (PDE) models, but their local limit reduces to partial differential equations. The effect of mesh element anisotropy mesh refinement and kernel functions on the conditioning of the stiffness matrix for a nonlocal diffusion model on 2D geometric domains is considered, and the results compared with those obtained from typical local PDE models. Numerical experiments show that the condition number is bounded by (where c is a constant) for an integrable kernel function, and is not affected by the choice of the basis function. In contrast to local PDE models, mesh anisotropy and refinement affect the condition number very little.
Maintaining good positioning performance has always been a challenging task for Global Navigation Satellite Systems (GNSS) applications in partially obstructed environments. A method that can optimise positioning performance in harsh environments is proposed. Using a carrier double-difference (DD) model, the influence of the satellite-pair geometry on the correlation among different equations has been researched. This addresses the critical relationship between DD equations and its ill-posedness. From analysing the collected multi-constellation observations, a strong correlation between the condition number and the positioning standard deviation is detected as the correlation coefficient is larger than 0·92. Based on this finding, a new method for determining the reference satellites by using the minimum condition number rather than the maximum elevation is proposed. This reduces the ill-posedness of the co-factor matrix, which improves the single-epoch positioning solution with a fixed DD ambiguity. Finally, evaluation trials are carried out by masking some satellites to simulate common satellite obstruction scenarios including azimuth shielding, elevation shielding and strip shielding. Results indicate the proposed approach improves the positioning stability with multi-constellation satellites notably in harsh environments.
We establish some explicit expressions for norm-wise, mixed and componentwise condition numbers for the weighted Moore-Penrose inverse of a matrix A ⊗ B and more general matrix function compositions involving Kronecker products. The condition number for the weighted least squares problem (WLS) involving a Kronecker product is also discussed.
Multivariate Markov chain models have previously been proposed in for studying dependent multiple categorical data sequences. For a given multivariate Markov chain model, an important problem is to study its joint stationary distribution. In this paper, we use two techniques to present some perturbation bounds for the joint stationary distribution vector of a multivariate Markov chain with s categorical sequences. Numerical examples demonstrate the stability of the model and the effectiveness of our perturbation bounds.
In the spectral solution of 3-D Poisson equations in cylindrical and spherical coordinates including the axis or the center, it is convenient to employ radial basis functions that depend on the Fourier wavenumber or on the latitudinal mode. This idea has been adopted by Matsushima and Marcus and by Verkley for planar problems and pursued by the present authors for spherical ones. For the Dirichlet boundary value problem in both geometries, original bases have been introduced built upon Jacobi polynomials which lead to a purely diagonal representation of the radial second-order differential operator of all spectral modes. This note details the origin of such a diagonalization which extends to cylindrical and spherical regions the properties of the Legendre basis introduced by Jie Shen for Cartesian domains. Closed form expressions are derived for the diagonal elements of the stiffness matrices as well as for the elements of the tridiagonal mass matrices occurring in evolutionary problems. Furthermore, the bound on the condition number of the spectral matrices associated with the Helmholtz equation are determined, proving in a rigorous way one of the main advantages of the proposed radial bases.
This paper addresses the dynamic dexterity of a planar 2-degree of freedom (DOF) parallel manipulator with virtual constraint. Without simplification, the dynamic formulation is derived by using the virtual work principle. The condition number of the inertia matrix of the dynamic equation is presented as a criterion to evaluate the dynamic dexterity of a manipulator. In order to obtain the best isotropic configuration of the dynamic dexterity in the whole workspace, two global performance indices, which consider the mean value and standard deviation of the condition number of the inertia matrix, respectively, are proposed as the objective function. For a given set of geometrical and inertial parameters, the dynamic dexterity of the parallel manipulator is more isotropic in the center than at the boundaries of the workspace.
This paper derives upper and lower bounds for the $\ell^p$-conditionnumber of the stiffness matrix resulting from the finite elementapproximation of a linear, abstract model problem. Sharp estimates interms of the meshsize h are obtained. The theoretical results areapplied to finite element approximations of elliptic PDE's invariational and in mixed form, and to first-order PDE's approximatedusing the Galerkin–Least Squares technique or bymeans of a non-standard Galerkin technique in L1(Ω). Numerical simulations are presented to illustrate thetheoretical results.
We show that, for reversible continuous-time Markov chains, the closeness of the nonzero eigenvalues of the generator to zero provides complete information about the sensitivity of the distribution vector to perturbations of the generator. Our results hold for both the transient and the stationary states.
For any bounded linear operator A in a Banach space, two generalized condition numbers, k(A) and k(A) are defined in this paper. These condition numbers may be applied to the perturbation analysis for the solution of ill-posed differential equations and bounded linear operator equations in infinite dimensional Banach spaces. Different expressions for the two generalized condition numbers are discussed in this paper and applied to the perturbation analysis of the operator equation.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.