检索结果-内蒙古大学图书馆

International conference on Information and Communication Technologies (ICICT)

作者： A. Usman M. Lujan L. Freeman Pakistan Institute of Engineering and Applied Sciences Islamabad Pakistan Centre for Novel Computing University of Manchester Institute of Science and Technology Manchester UK

Sparse matrices are pervasive in many Computational Science and Engineering (CS&E) applications. There is a significant number of storage formats used to represent sparse matrices. This paper presents a performance evaluation of storage formats for the main kernel of iterative methods for numerical linear algebra, namely matrix-vector multiplication. The experiments consider a set of almost 200 sparse matrices from the Matrix Market collection covering both systems of linear equations and eigenvalue problems. For each matrix, the experiments perform the matrix-vector multiplication with most commonly used sparse storage formats and also the recently proposed Java Sparse Array storage fonmat. To the best of the authors' knowledge, there is no other performance evaluation of storage formats for sparse matrices which consider such a variety of matrices and storage formats.

关键词： Sparse matrices Pervasive computing Kernel Iterative methods linear algebra Equations Eigenvalues and eigenfunctions Java

来源：评论

学校读者我要写书评

暂无评论

Synthesis of Beam Lines with Necessary Properties

Synthesis of Beam Lines with Necessary Properties

引用

IEEE conference on Particle Accelerator

作者： S.N. Andrianov Saint Petersburg State Polytechnical University Saint Petersburg Russia

In this paper a new approach to the problem of synthesis of beam lines is discussed. Usually this problem can be overcome by the use of numerical simulation and opti mal control theory methods. But this results in sufficiently great number of variable parameters and functions. Obviously, that this degrades quality of a modeling procedure. The suggested approach is demonstrated on a problem of a microprobe design problem. Essence of the problem is that necessary to design a high precision focusing system which satisfies some additional conditions. For solution of this problem we use an algebraic treatment based on Lie algebraic methods and computer algebra techniques. Using the symmetry ideology this approach allows rewriting beam properties to enough simple conditions for control parameters and functions. This leads a set of desired solutions and show results in some most suitable form. Moreover, this approach decreases the number of variable parameters.

关键词： Focusing Optimal control Optical beams numerical simulation Degradation algebra Process design Particle beams linear approximation Length measurement

来源：评论

学校读者我要写书评

暂无评论

A tubular linear motor for micro robotic applications

A tubular linear motor for micro robotic applications

引用

International conference on Mechatronics (ICM)

作者： Haiwei Lu Jianguo Zhu Youguang Guo Faculty of Engineering University of Technology Sydney Australia

linear micro motors play a key role in micro robotic systems. They can greatly simplify the drive mechanisms, which is crucial for micro systems. By using permanent magnets, much higher force-to-volume ratios can be acquired than using electromagnets and better drive performance can be obtained. This paper describes the development of a tubular permanent magnet linear motor for the actuation of micro robots. Important design criteria are established by both analytical and numerical methods. The performances of the micro motor as well as the entire actuation system are analyzed and predicted by the finite element analysis and kinetic modeling. The results show that the proposed linear motor has the quite satisfactory force capability and kinetic performance.

关键词： Micromotors Robots Magnetic analysis Permanent magnet motors Performance analysis Kinetic theory Permanent magnets Electromagnets Finite element methods Predictive models

来源：评论

学校读者我要写书评

暂无评论

numerical Modeling and Inverse Scattering in Nondestructive Testing: Recent applications and Advances

引用

AIP conference Proceedings 2005年第1期760卷 775-782页

作者： R. Marklein K. J. Langenberg K. Mayer A. Shlivinski J. Miao A. Zimmer W. Müller V. Schmitz C. Kohl U. Mletzko 1Electromagnetic Theory Department of Electrical Engineering and Computer Science University of Kassel D‐34109 Kassel Germany 2Fraunhofer Institute for Nondestructive Testing (IZFP) University Building 37 D‐66123 Saarbrücken Germany 3Federal Research Institute for Material Research and Testing D‐12200 Berlin Germany 4MPA/NDT Group University of Stuttgart D‐70511 Stuttgart Germany

This paper presents recent advances and future challenges of the application of different numerical modeling tools and linear and nonlinear inversion algorithms in ultrasonics and electromagnetics applied in NDE. The inversion methods considered in the presented work vary from linear schemes, e.g. SAFT/InASAFT and Diffraction Tomography/FT‐SAFT, to nonlinear schemes, e.g. the Contrast Source Inversion. Inversion results are presented and compared for modeled and measured ultrasonic and electromagnetic data to locate voids and cracks as well as to locate aluminum tendon ducts in concrete, which is a typical GPR problem. Finite Integration Technique (FIT) and Domain Integral Equation (DIE) solvers are used as modeling tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Application of digital control theory to exact discretization of a logistic equation with a constant term

Application of digital control theory to exact discretizatio...

引用

IEEE conference on Control Technology and applications (CCTA)

作者： N. Hori C.A. Rabbath Digital Control Laboratory Graduate School of Systems and Information Engineering University of Tsukuba Tsukuba Ibaraki Japan Defence Research and Development Canada Val-Belair QUE Canada

This paper presents an exact method of discretizing a logistic differential equation with a constant term (a class of Riccati equation), which are prevalent in a variety of fields, using a common knowledge in digital control theory. The resulting model gives the value that is exact at the discrete-time instants for any discretization period. Two existing methods that can lead to an exact discrete-time model are second-order and shown to be based on diverging variables, while the one proposed in this study is first-order and not prone to such a numerical problem. A simulation result is presented to illustrate this issue

关键词： Digital control Logistics Riccati equations Nonlinear systems Differential equations Nonlinear equations Chaos linear systems Nonlinear control systems Sampling methods

来源：评论

学校读者我要写书评

暂无评论

On solving periodic differential matrix equations with applications to periodic system norms computation

On solving periodic differential matrix equations with appli...

引用

IEEE conference on Decision and Control

作者： A. Varga German Aerospace Center DLR-Oberpfaffenhofen Institute of Robotics and Mechatronics Wessling Germany

ISBN: (纸本)0780395670

Periodic Lyapunov, Sylvester and Riccati differential equations have many important applications in the analysis and design of linear periodic control systems. For the numerical solution of these equations efficient numerically reliable algorithms based on the periodic Schur decomposition are proposed. The new multi-shot type algorithms compute periodic solutions in an arbitrary number of time moments within one period by employing suitable discretizations of the continuous-time problems. In contrast to traditionally used one-shot periodic generator methods, the multi-shot type methods have the advantage to be able to address problems with large periods and/or unstable dynamics. applications of the proposed techniques to compute several system norms are presented.

关键词： Differential equations Riccati equations Control systems Aerodynamics Eigenvalues and eigenfunctions Control system analysis Controllability Observability Filtering theory Software algorithms

来源：评论

学校读者我要写书评

暂无评论

Resultant Based methods Computing the Greatest Common Divisor of Several Polynomials

Resultant Based Methods Computing the Greatest Common Diviso...

引用

IEEE International Symposium on Intelligent Control (ISIC)

作者： D. Triantafyllou M. Mitrouli N. Karcanias Department of Mathematics University of Athens (NKUA) Athens Greece Control Engineering Centre School of Engineering and Mathematical Science City University Northampton Square London UK

In this paper we develop two resultant based methods for the computation of the greatest common divisor (GCD) of many polynomials. Let S be the resultant Sylvester's matrix of the polynomials. The application of classical LU and QR factorization to S for the computation of its GCD has an inappropriate complexity of order O(n 4 ). We modified matrix S to S* such that the rows with non-zero elements under the main diagonal, at every column, are gathered together. We constructed modified versions of the LU and QR procedures which lead to the computation of the GCD of S* in O(n 3 ) floating point operations. Both methods are tested for several sets of polynomials and tables summarizing all the achieved results are given

关键词： Polynomials Computer errors Testing numerical analysis linear algebra Control theory Matrices Statistical analysis Floating-point arithmetic Stability

来源：评论

学校读者我要写书评

暂无评论

On the positivity of matrix-vector products

引用

linear algebra AND ITS applications 2004年第1-3期393卷 253-258页

作者： Horváth, Z Szechenyi Istvan Univ Dept Math H-9026 Gyor Hungary

In this paper we examine the positivity of Rv where R is an element of R-NxN, v is an element of R-N, v greater than or equal to 0 with R = r(tauA), r is a given (rational) function, A is an element of R-NxN and tau is an element of (0, infinity). Here we mean by positivity the ordering w.r.t. an arbitrary order cone, which includes the classical entrywise positivity of vectors. Since the requirement R greater than or equal to 0 leads to very severe restrictions on r and tau we construct apositive cone P = P(A) and determine tau* = tau*(r, P) such that r(tauA)P subset of P for all tau is an element of [0, tau*]. Finally we give an example arising from applications to partial differential equations where our results explain actual computations much better than the general theory on R greater than or equal to 0. (C) 2004 Elsevier Inc. All rights reserved.

关键词： positive matrices invariant cone positivity numerical methods

来源：评论

学校读者我要写书评

暂无评论

Fourier two-level analysis for discontinuous Galerkin discretization with linear elements

引用

numerical linear algebra WITH applications 2004年第5-6期11卷 473-491页

作者： Hemker, PW Hoffmann, W van Raalte, MH CWI NL-1090 GB Amsterdam Netherlands Univ Amsterdam KdV Inst Math Amsterdam Netherlands

In this paper vie study the convergence of a multigrid method for the solution of a linear second-order elliptic equation, discretized by discontinuous Galerkin (DG) methods, and we give a detailed analysis of the convergence for different block-relaxation strategies. To complement an earlier paper where higher-order methods were studied, here we restrict ourselves to methods using piecewise linear approximations. It is well known that these methods are unstable if no additional interior penalty is applied. As for the higher-order methods, we find that point-wise block-relaxations give much better results than the classical cell-wise relaxations. Both for the Baumann-Oden and for the symmetric DG method, with a sufficient interior penalty, the block-relaxation methods studied (Jacobi, Gauss-Seidel and symmetric Gauss-Seidel) all make excellent smoothing procedures in a classical multigrid setting. Independent of the mesh size, simple MG cycles give convergence factors 0.2-0.4 per iteration sweep for the different discretizations studied. Copyright (C) 2004 John Wiley Sons, Ltd.

关键词： discontinuous Galerkin method multigrid iteration two-level Fourier analysis point-wise block-relaxation

来源：评论

学校读者我要写书评

暂无评论

On doubly structured matrices and pencils that arise in linear response theory

引用

linear algebra AND ITS applications 2004年 380卷 3-51页

作者： Mehl, C Mehrmann, V Xu, HG Tech Univ Berlin Inst Math D-10623 Berlin Germany Univ Kansas Dept Math Lawrence KS 66045 USA

We discuss matrix pencils with a double symmetry structure that arise in the Hartree-Fock model in quantum chemistry. We derive anti-triangular condensed forms from which the eigenvalues can be read off. Ideally these would be condensed forms under unitary equivalence transformations that can be turned into stable (structure preserving) numerical methods. For the pencils under consideration this is a difficult task and not always possible. We present necessary and sufficient conditions when this is possible. If this is not possible then we show how we can include other transformations that allow to reduce the pencil to an almost anti-triangular form. (C) 2003 Elsevier Inc. All rights reserved.

关键词： self-adjoint matrix skew-adjoint matrix matrix pencil Hartree-Fock model random phase approximation anti-triangular form canonical form condensed form Skew-Hamiltonian/Hamiltonian pencil

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：