The Choice of Lattice Planes in X-Ray Strain Measurements of Single Crystals

1985 ◽  
Vol 29 ◽  
pp. 113-118 ◽  
Author(s):  
Balder Ortner
Keyword(s):  
Measurement Errors ◽  
Linear Equations ◽  
Strain Tensor ◽  
Equation System ◽  
Necessary Condition ◽  
X Rays ◽  
Distance Measurements ◽  
The Matrix ◽  
Strain Components ◽  
Lattice Planes

It is well known that all of the six independent components of the strain tensor can be calculated if the linear strains in six appropriate directions are known (e.g.). That calculation is to solve a system of linear equations, whose coefficients are defined by the orientations of the measured planes. The strains are determined by lattice plane distance measurements using X-rays.The linear equation system can only be solved if the matrix of coefficients has rank. Whether this condition is met or not can be decided without calculating a determinant just from geometric relationships among the planes to be measured. A demand beyond that necessary condition is to make the matrix of coefficients so that the accuracy of the calculated strain tensor is best. From error calculation we know that there exist distinct ratios between the inevitable measurement errors and the errors of the calculated strain components. These ratios depend strongly on the geometric relationship among the lattice planes. It is the purpose of this paper to show how lattice planes should be chosen in order to get these ratios as small as possible i.e. to get a maximum of accuracy at a given number of measurements, or a minimum of experimental effort if a distinct limit of error is to be reached.

The inverse problem of bimorph mirror tuning on a beamline

2011 ◽  
Vol 18 (6) ◽  
pp. 930-937 ◽  
Author(s):  
Rong Huang
Keyword(s):  
Inverse Problem ◽  
Tikhonov Regularization ◽  
Measurement Errors ◽  
Regularization Parameter ◽  
X Rays ◽  
The Matrix ◽  
Matrix Condition Number ◽  
Matrix Condition ◽  
Safety Limit

One of the challenges of tuning bimorph mirrors with many electrodes is that the calculated focusing voltages can be different by more than the safety limit (such as 500 V for the mirrors used at 17-ID at the Advanced Photon Source) between adjacent electrodes. A study of this problem at 17-ID revealed that the inverse problem of the tuningin situ, using X-rays, became ill-conditioned when the number of electrodes was large and the calculated focusing voltages were contaminated with measurement errors. Increasing the number of beamlets during the tuning could reduce the matrix condition number in the problem, but obtaining voltages with variation below the safety limit was still not always guaranteed and multiple iterations of tuning were often required. Applying Tikhonov regularization and using the L-curve criterion for the determination of the regularization parameter made it straightforward to obtain focusing voltages with well behaved variations. Some characteristics of the tuning results obtained using Tikhonov regularization are given in this paper.

scholarly journals HHL Analysis and Simulation Verification Based on Origin Quantum Platform

2021 ◽  
Vol 2113 (1) ◽  
pp. 012083
Author(s):  
Xiaonan Liu ◽  
Lina Jing ◽  
Lin Han ◽  
Jie Gao
Keyword(s):  
Large Scale ◽  
Weather Forecasting ◽  
Sparse Matrix ◽  
Linear Equations ◽  
Quantum Algorithm ◽  
Equation System ◽  
Quantum Circuit ◽  
Small Scale ◽  
The Matrix ◽  
Time Required

Abstract Solving large-scale linear equations is of great significance in many engineering fields, such as weather forecasting and bioengineering. The classical computer solves the linear equations, no matter adopting the elimination method or Kramer’s rule, the time required for solving is in a polynomial relationship with the scale of the equation system. With the advent of the era of big data, the integration of transistors is getting higher and higher. When the size of transistors is close to the order of electron diameter, quantum tunneling will occur, and Moore’s Law will not be followed. Therefore, the traditional computing model will not be able to meet the demand. In this paper, through an in-depth study of the classic HHL algorithm, a small-scale quantum circuit model is proposed to solve a 2×2 linear equations, and the circuit diagram and programming are used to simulate and verify on the Origin Quantum Platform. The fidelity under different parameter values reaches more than 90%. For the case where the matrix to be solved is a sparse matrix, the quantum algorithm has an exponential speed improvement over the best known classical algorithm.

Improving x-ray map resolution with image restoration techniques

1996 ◽  
Vol 54 ◽  
pp. 598-599
Author(s):  
Richard B. Mott ◽  
John J. Friel ◽  
Charles G. Waldman
Keyword(s):  
Image Restoration ◽  
Hubble Space Telescope ◽  
Extensive Literature ◽  
Small Object ◽  
X Rays ◽  
X Ray ◽  
Mapping Parameters ◽  
The Matrix ◽  
The 1960S ◽  
Map Resolution

X-rays are emitted from a relatively large volume in bulk samples, limiting the smallest features which are visible in X-ray maps. Beam spreading also hampers attempts to make geometric measurements of features based on their boundaries in X-ray maps. This has prompted recent interest in using low voltages, and consequently mapping L or M lines, in order to minimize the blurring of the maps.An alternative strategy draws on the extensive work in image restoration (deblurring) developed in space science and astronomy since the 1960s. A recent example is the restoration of images from the Hubble Space Telescope prior to its new optics. Extensive literature exists on the theory of image restoration. The simplest case and its correspondence with X-ray mapping parameters is shown in Figures 1 and 2.Using pixels much smaller than the X-ray volume, a small object of differing composition from the matrix generates a broad, low response. This shape corresponds to the point spread function (PSF). The observed X-ray map can be modeled as an “ideal” map, with an X-ray volume of zero, convolved with the PSF. Figure 2a shows the 1-dimensional case of a line profile across a thin layer. Figure 2b shows an idealized noise-free profile which is then convolved with the PSF to give the blurred profile of Figure 2c.

On Some Properties of Semi-rings

2018 ◽  
pp. 35-50
Author(s):  
A. I. Belousov
Keyword(s):  
Linear Equations ◽  
Oriented Graph ◽  
Theoretical Computer Science ◽  
Alternative Methods ◽  
Main Role ◽  
Cost Matrix ◽  
Sequential Elimination ◽  
The Matrix ◽  
Systems Of Linear Equations ◽  
The Cost

The main objective of this paper is to prove a theorem according to which a method of successive elimination of unknowns in the solution of systems of linear equations in the semi-rings with iteration gives the really smallest solution of the system. The proof is based on the graph interpretation of the system and establishes a relationship between the method of sequential elimination of unknowns and the method for calculating a cost matrix of a labeled oriented graph using the method of sequential calculation of cost matrices following the paths of increasing ranks. Along with that, and in terms of preparing for the proof of the main theorem, we consider the following important properties of the closed semi-rings and semi-rings with iteration.We prove the properties of an infinite sum (a supremum of the sequence in natural ordering of an idempotent semi-ring). In particular, the proof of the continuity of the addition operation is much simpler than in the known issues, which is the basis for the well-known algorithm for solving a linear equation in a semi-ring with iteration.Next, we prove a theorem on the closeness of semi-rings with iteration with respect to solutions of the systems of linear equations. We also give a detailed proof of the theorem of the cost matrix of an oriented graph labeled above a semi-ring as an iteration of the matrix of arc labels.The concept of an automaton over a semi-ring is introduced, which, unlike the usual labeled oriented graph, has a distinguished "final" vertex with a zero out-degree.All of the foregoing provides a basis for the proof of the main theorem, in which the concept of an automaton over a semi-ring plays the main role.The article's results are scientifically and methodologically valuable. The proposed proof of the main theorem allows us to relate two alternative methods for calculating the cost matrix of a labeled oriented graph, and the proposed proofs of already known statements can be useful in presenting the elements of the theory of semi-rings that plays an important role in mathematical studies of students majoring in software technologies and theoretical computer science.

scholarly journals Investigation of Deformation Inhomogeneity and Low-Cycle Fatigue of a Polycrystalline Material

2021 ◽  
Vol 11 (6) ◽  
pp. 2673
Author(s):  
Mu-Hang Zhang ◽  
Xiao-Hong Shen ◽  
Lei He ◽  
Ke-Shi Zhang
Keyword(s):  
Cyclic Loading ◽  
Low Cycle Fatigue ◽  
Strain Tensor ◽  
Equivalent Strain ◽  
Differential Entropy ◽  
Strain Components ◽  
Deformation Inhomogeneity ◽  
Standard Deviations ◽  
Number Of Cycles ◽  
The Relationship

Considering the relationship between inhomogeneous plastic deformation and fatigue damage, deformation inhomogeneity evolution and fatigue failure of superalloy GH4169 under temperature 500 °C and macro tension compression cyclic loading are studied, by using crystal plasticity calculation associated with polycrystalline representative Voronoi volume element (RVE). Different statistical standard deviation and differential entropy of meso strain are used to measure the inhomogeneity of deformation, and the relationship between the inhomogeneity and strain cycle is explored by cyclic numerical simulation. It is found from the research that the standard deviations of each component of the strain tensor at the cyclic peak increase monotonically with the cyclic loading, and they are similar to each other. The differential entropy of each component of the strain tensor also increases with the number of cycles, and the law is similar. On this basis, the critical values determined by statistical standard deviations of the strain components and the equivalent strain, and that by differential entropy of strain components, are, respectively, used as fatigue criteria, then predict the fatigue–life curves of the material. The predictions are verified with reference to the measured results, and their deviations are proved to be in a reasonable range.

Spectral analysis of M/G/1 and G/M/1 type Markov chains

1996 ◽  
Vol 28 (01) ◽  
pp. 114-165 ◽  
Author(s):  
H. R. Gail ◽  
S. L. Hantler ◽  
B. A. Taylor
Keyword(s):  
Markov Chains ◽  
Generating Functions ◽  
Complex Analysis ◽  
Linear Equations ◽  
Sufficient Conditions ◽  
Equilibrium Analysis ◽  
Transform Method ◽  
Technical Problems ◽  
The Matrix ◽  
Transient Case

When analyzing the equilibrium behavior of M/G/1 type Markov chains by transform methods, restrictive hypotheses are often made to avoid technical problems that arise in applying results from complex analysis and linear algebra. It is shown that such restrictive assumptions are unnecessary, and an analysis of these chains using generating functions is given under only the natural hypotheses that first moments (or second moments in the null recurrent case) exist. The key to the analysis is the identification of an important subspace of the space of bounded solutions of the system of homogeneous vector-valued Wiener–Hopf equations associated with the chain. In particular, the linear equations in the boundary probabilities obtained from the transform method are shown to correspond to a spectral basis of the shift operator on this subspace. Necessary and sufficient conditions under which the chain is ergodic, null recurrent or transient are derived in terms of properties of the matrix-valued generating functions determined by transitions of the Markov chain. In the transient case, the Martin exit boundary is identified and shown to be associated with certain eigenvalues and vectors of one of these generating functions. An equilibrium analysis of the class of G/M/1 type Markov chains by similar methods is also presented.

scholarly journals On circulant codes with prescribed distances

1977 ◽  
Vol 16 (3) ◽  
pp. 361-369
Author(s):  
M. Deza ◽  
Peter Eades
Keyword(s):  
Sufficient Conditions ◽  
Difference Sets ◽  
Necessary And Sufficient Conditions ◽  
Necessary Condition ◽  
Weighing Matrices ◽  
Cyclic Difference Sets ◽  
The Matrix ◽  
Circulant Codes ◽  
Necessary And Sufficient ◽  
Square Matrix

Necessary and sufficient conditions are given for a square matrix to te the matrix of distances of a circulant code. These conditions are used to obtain some inequalities for cyclic difference sets, and a necessary condition for the existence of circulant weighing matrices.

MRHS solver based on linear algebra and exhaustive search

2018 ◽  
Vol 12 (3) ◽  
pp. 143-157 ◽  
Author(s):  
Håvard Raddum ◽  
Pavol Zajac
Keyword(s):  
Linear Algebra ◽  
Matrix Representation ◽  
Equation System ◽  
Exhaustive Search ◽  
Binary Matrix ◽  
Algebraic Attacks ◽  
The Matrix ◽  
Speed Up ◽  
Symmetric Key

Abstract We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks. We give an algorithm for solving the system and compute its complexity. The complexity is normally close to exhaustive search on the variables representing the user-selected key. Finally, we show that for some variants of LowMC, the joined MRHS matrix representation can be used to speed up regular encryption in addition to exhaustive key search.

scholarly journals Matrix and vector sequence transformations revisited

1995 ◽  
Vol 38 (3) ◽  
pp. 495-510 ◽  
Author(s):  
C. Brezinski ◽  
A. Salam
Keyword(s):  
Linear Equations ◽  
Convergence Acceleration ◽  
Difference Operators ◽  
Scalar Case ◽  
Extrapolation Methods ◽  
System Of Linear Equations ◽  
Vector Sequence ◽  
The Matrix ◽  
Sequence Transformations

Sequence transformations are extrapolation methods. They are used for the purpose of convergence acceleration. In the scalar case, such algorithms can be obtained by two different approaches which are equivalent. The first one is an elimination approach based on the solution of a system of linear equations and it makes use of determinants. The second approach is based on the notion of annihilation difference operators. In this paper, these two approaches are generalized to the matrix and the vector cases.

scholarly journals CONSTRUCTION OF MINIMAX CONTROL FOR ALMOST CONSERVATIVE CONTROLLED DYNAMIC SYSTEMS WITH THE LIMITED PERTURBATIONS

2017 ◽  
Vol 2 ◽  
pp. 9-15
Author(s):  
Iryna Svyatovets
Keyword(s):  
Riccati Equation ◽  
Infinite System ◽  
Conservative System ◽  
Coefficient Matrix ◽  
Necessary Condition ◽  
Existence Of A Solution ◽  
Minimax Control ◽  
System Of Matrix Equations ◽  
System A ◽  
The Matrix

The problem is considered for constructing a minimax control for a linear stationary controlled dynamical almost conservative system (a conservative system with a weakly perturbed coefficient matrix) on which an unknown perturbation with bounded energy acts. To find the solution of the Riccati equation, an approach is proposed according to which the matrix-solution is represented as a series expansion in a small parameter and the unknown components of this matrix are determined from an infinite system of matrix equations. A necessary condition for the existence of a solution of the Riccati equation is formulated, as well as theorems on additive operations on definite parametric matrices. A condition is derived for estimating the parameter appearing in the Riccati equation. An example of a solution of the minimax control problem for a gyroscopic system is given. The system of differential equations, which describes the motion of a rotor rotating at a constant angular velocity, is chosen as the basis.

Sign in / Sign up

Export Citation Format

Share Document