923 resultados para Linear matrix inequalities
Resumo:
An evaluation of the pesticides extracted from the soil matrix was conducted using a citrate-buffered solid phase dispersion sample preparation method (QuEChERS). The identification and quantitation of pesticide compounds was performed using gas chromatography-mass spectrometry. Because of the occurrence of the matrix effect in 87% of the analyzed pesticides, the quantification was performed using matrix-matched calibration. The method's quantification limits were between 0.01 and 0.5 mg kg-1. Repeatability and intermediate precision, expressed as a relative standard deviation percentage, were less than 20%. The recoveries in general ranged between 62% and 99%, with a relative standard deviation < 20%. All the responses were linear, with a correlation coefficient (r) ≥0.99.
Resumo:
This paper brings an active and provocative area of current research. It describes the investigation of electron transfer (ET) chemistry in general and ET reactions results in DNA in particular. Two DNA intercalating molecules were used: Ethidium Bromide as the donor (D) and Methyl-Viologen as the acceptor (A), the former intercalated between DNA bases and the latter in its surface. Using the Perrin model and fluorescence quenching measurements the distance of electron migration, herein considered to be the linear spacing between donor and acceptor molecule along the DNA molecule, was obtained. A value of 22.6 (± 1.1) angstroms for the distance and a number of 6.6 base pairs between donor and acceptor were found. In current literature the values found were 26 angstroms and almost 8 base pairs. DNA electron transfer is considered to be mediated by through-space interactions between the p-electron-containing base pairs.
Resumo:
A study about the spatial variability of data of soil resistance to penetration (RSP) was conducted at layers 0.0-0.1 m, 0.1-0.2 m and 0.2-0.3 m depth, using the statistical methods in univariate forms, i.e., using traditional geostatistics, forming thematic maps by ordinary kriging for each layer of the study. It was analyzed the RSP in layer 0.2-0.3 m depth through a spatial linear model (SLM), which considered the layers 0.0-0.1 m and 0.1-0.2 m in depth as covariable, obtaining an estimation model and a thematic map by universal kriging. The thematic maps of the RSP at layer 0.2-0.3 m depth, constructed by both methods, were compared using measures of accuracy obtained from the construction of the matrix of errors and confusion matrix. There are similarities between the thematic maps. All maps showed that the RSP is higher in the north region.
Resumo:
In this article a two-dimensional transient boundary element formulation based on the mass matrix approach is discussed. The implicit formulation of the method to deal with elastoplastic analysis is considered, as well as the way to deal with viscous damping effects. The time integration processes are based on the Newmark rhoand Houbolt methods, while the domain integrals for mass, elastoplastic and damping effects are carried out by the well known cell approximation technique. The boundary element algebraic relations are also coupled with finite element frame relations to solve stiffened domains. Some examples to illustrate the accuracy and efficiency of the proposed formulation are also presented.
Resumo:
Nowadays problem of solving sparse linear systems over the field GF(2) remain as a challenge. The popular approach is to improve existing methods such as the block Lanczos method (the Montgomery method) and the Wiedemann-Coppersmith method. Both these methods are considered in the thesis in details: there are their modifications and computational estimation for each process. It demonstrates the most complicated parts of these methods and gives the idea how to improve computations in software point of view. The research provides the implementation of accelerated binary matrix operations computer library which helps to make the progress steps in the Montgomery and in the Wiedemann-Coppersmith methods faster.
Resumo:
Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.
Resumo:
In this paper, we study the asymptotic distribution of a simple two-stage (Hannan-Rissanen-type) linear estimator for stationary invertible vector autoregressive moving average (VARMA) models in the echelon form representation. General conditions for consistency and asymptotic normality are given. A consistent estimator of the asymptotic covariance matrix of the estimator is also provided, so that tests and confidence intervals can easily be constructed.
Resumo:
The nanosecond optical-limiting characteristics (at 532 nm) of some rare-earth metallo-phthalocyanines (Sm(Pc)2, Eu(Pc)2, and LaPc) doped in a copolymer matrix of poly(methyl methacrylate) and methyl-2-cyanoacrylate have been studied for the first time to our knowledge. The optical-limiting response is attributed to reverse saturable absorption due to excited-state absorption. The performance of LaPc in a copolymer host is studied at different linear transmissions. The laser damage thresholds of all the samples are also reported.
Resumo:
This thesis Entitled Spectral theory of bounded self-adjoint operators -A linear algebraic approach.The main results of the thesis can be classified as three different approaches to the spectral approximation problems. The truncation method and its perturbed versions are part of the classical linear algebraic approach to the subject. The usage of block Toeplitz-Laurent operators and the matrix valued symbols is considered as a particular example where the linear algebraic techniques are effective in simplifying problems in inverse spectral theory. The abstract approach to the spectral approximation problems via pre-conditioners and Korovkin-type theorems is an attempt to make the computations involved, well conditioned. However, in all these approaches, linear algebra comes as the central object. The objective of this study is to discuss the linear algebraic techniques in the spectral theory of bounded self-adjoint operators on a separable Hilbert space. The usage of truncation method in approximating the bounds of essential spectrum and the discrete spectral values outside these bounds is well known. The spectral gap prediction and related results was proved in the second chapter. The discrete versions of Borg-type theorems, proved in the third chapter, partly overlap with some known results in operator theory. The pure linear algebraic approach is the main novelty of the results proved here.
Resumo:
During recent years, the theory of differential inequalities has been extensively used to discuss singular perturbation problems and method of lines to partial differential equations. The present thesis deals with some differential inequality theorems and their applications to singularly perturbed initial value problems, boundary value problems for ordinary differential equations in Banach space and initial boundary value problems for parabolic differential equations. The method of lines to parabolic and elliptic differential equations are also dealt The thesis is organised into nine chapters
Resumo:
We investigate solution sets of a special kind of linear inequality systems. In particular, we derive characterizations of these sets in terms of minimal solution sets. The studied inequalities emerge as information inequalities in the context of Bayesian networks. This allows to deduce important properties of Bayesian networks, which is important within causal inference.
Resumo:
We study the preconditioning of symmetric indefinite linear systems of equations that arise in interior point solution of linear optimization problems. The preconditioning method that we study exploits the block structure of the augmented matrix to design a similar block structure preconditioner to improve the spectral properties of the resulting preconditioned matrix so as to improve the convergence rate of the iterative solution of the system. We also propose a two-phase algorithm that takes advantage of the spectral properties of the transformed matrix to solve for the Newton directions in the interior-point method. Numerical experiments have been performed on some LP test problems in the NETLIB suite to demonstrate the potential of the preconditioning method discussed.
Resumo:
Epipolar geometry is a key point in computer vision and the fundamental matrix estimation is the only way to compute it. This article surveys several methods of fundamental matrix estimation which have been classified into linear methods, iterative methods and robust methods. All of these methods have been programmed and their accuracy analysed using real images. A summary, accompanied with experimental results, is given
Resumo:
Lecture slides and notes for a PhD level course on linear algebra for electrical engineers and computer scientists. This course is given in in the framework of the School of Electronics and Computer Science Mathematics Training Courses https://secure.ecs.soton.ac.uk/notes/pg_maths/ (ECS password required)
Resumo:
Exam questions and solutions in PDF