Performance index mance evaluation, and is the is the standard of perfor- foundation of both perfor- mance analysis and optimal design for the parallel manipulator. Seeking the suitable kinematic indices is always an ...Performance index mance evaluation, and is the is the standard of perfor- foundation of both perfor- mance analysis and optimal design for the parallel manipulator. Seeking the suitable kinematic indices is always an important and challenging issue for the parallel manipulator. So far, there are extensive studies in this field, but few existing indices can meet all the requirements, such as simple, intuitive, and universal. To solve this problem, the matrix orthogonal degree is adopted, and generalized transmission indices that can evaluate motion/force trans- missibility of fully parallel manipulators are proposed. Transmission performance analysis of typical branches, end effectors, and parallel manipulators is given to illus- trate proposed indices and analysis methodology. Simula- tion and analysis results reveal that proposed transmission indices possess significant advantages, such as normalized finite （ranging from 0 to l）, dimensionally homogeneous, frame-free, intuitive and easy to calculate. Besides, pro- posed indices well indicate the good transmission region and relativity to the singularity with better resolution than the traditional local conditioning index, and provide a novel tool for kinematic analysis and optimal design of fully parallel manipulators.展开更多
In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Erro...In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.展开更多
In this article, the author characterizes orthogonal polynomials on an arbitrary smooth Jordan curve by a semi-conjugate matrix boundary value problem, which is different from the Riemann-Hilbert problems that appear ...In this article, the author characterizes orthogonal polynomials on an arbitrary smooth Jordan curve by a semi-conjugate matrix boundary value problem, which is different from the Riemann-Hilbert problems that appear in the theory of Riemann -Hilbert approach to asymptotic analysis for orthogonal polynomials on a real interval introduced by Fokas, Its, and Kitaev and on the unit circle introduced by Baik, Deift, and Johansson. The author hopes that their characterization may be applied to asymptotic analysis for general orthogonal polynomials by combining with a new extension of steepest descent method which we are looking for.展开更多
In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a th...In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.展开更多
In this paper,we introduce matrix-valued multiresolution analysis and orthogonal matrix-valued wavelets.We obtain a necessary and sufficient condition on the existence of orthogonal matrix-valued wavelets by means of ...In this paper,we introduce matrix-valued multiresolution analysis and orthogonal matrix-valued wavelets.We obtain a necessary and sufficient condition on the existence of orthogonal matrix-valued wavelets by means of paraunitary vector filter bank theory.A method for constructing a class of compactly supported orthogonal matrix-valued wavelets is proposed by using multiresolution analysis method and matrix theory.展开更多
Given a positive definite matrix measure Ω supported on the unit circle T, then main purpose of this paper is to study the asymptotic behavior of L n()L n(Ω) -1 and Φ n(z;)Φ n(z;Ω) -1 where(z)=Ω(z)+Mδ(z-w...Given a positive definite matrix measure Ω supported on the unit circle T, then main purpose of this paper is to study the asymptotic behavior of L n()L n(Ω) -1 and Φ n(z;)Φ n(z;Ω) -1 where(z)=Ω(z)+Mδ(z-w); |w|>1,M is a positive definite matrix and δ is the Dirac matrix measure. Here, L n(·) means the leading coefficient of the orthonormal matrix polynomials Φ n(z;·). Finally, we deduce the asymptotic behavior of Φ n(w;)Φ n(w;Ω)* in the case when M=I.展开更多
UE-Brzier （unified and extended Brzier） basis is the unified form of Brzier-like bases, including polynomial Brzier basis, trigonometric polynomial and hyperbolic polynomial Brzier basis. Similar to the original Brz...UE-Brzier （unified and extended Brzier） basis is the unified form of Brzier-like bases, including polynomial Brzier basis, trigonometric polynomial and hyperbolic polynomial Brzier basis. Similar to the original Brzier-like bases, UE-Brzier basis func-tions are not orthogonal. In this paper, a group of orthogonal basis is constructed based on UE-Brzier basis. The transformation matrices between UE-Brzier basis and the proposed orthogonal basis are also solved.展开更多
Matrix expression of finite orthogonal wavelet transform of finite impulse response signal is more valuable for theoretical analysis and understanding. However, clear deduction for matrix expression has not been provi...Matrix expression of finite orthogonal wavelet transform of finite impulse response signal is more valuable for theoretical analysis and understanding. However, clear deduction for matrix expression has not been provided yet. In this paper, the formulation to generate the re-lated matrix is put forward and the theorem on the orthogonality of this matrix proved. This effort deploys a basis for more deeper and wider applications in chemical processes. *展开更多
Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-...Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-1)-flat is associated with a point in PG(m-1, sn). An orthogonal array Lsmn((sn)(smn-)(sn-1) can be constructed by using (smn-1)/( sn-1) points in PG(m-1, sn). A set of (st-1)/(s-1) points in PG(m-1, sn) is called a (t-1)-flat over GF(s) if it is isomorphic to PG(t-1, s). If there exists a (t-1)-flat over GF(s) in PG(m-1, sn), then we can replace the corresponding [(st-1)/(s-1)] sn-level columns in Lsmn((sn)(smn-)(sn-1) by (smn-1)/( sn-1) st -level columns and obtain a mixed orthogonal array. Many new mixed orthogonal arrays can be obtained by this procedure. In this paper, we study methods for finding disjoint (t-1)-flats over GF(s) in PG(m-1, sn) in order to construct more mixed orthogonal arrays of strength two. In particular, if m and n are relatively prime then we can construct an Lsmn((sm)smn-1/sm-1-i(sn-1)/ (s-1)( sn) i(sm-1)/ s-1) for any 0i(smn-1)(s-1)/( sm-1)( sn-1) New orthogonal arrays of sizes 256, 512, and 1024 are obtained by using PG(7,2), PG(8,2), and PG(9,2) respectively.展开更多
A method of constructing orthogonal arrays is presented by Zhang, Lu and Pang in 1999.In this paper,the method is developed by introducing a replacement scheme on the construction of orthogonal arrays ,and some new mi...A method of constructing orthogonal arrays is presented by Zhang, Lu and Pang in 1999.In this paper,the method is developed by introducing a replacement scheme on the construction of orthogonal arrays ,and some new mixed-level orthogonal arrays of run size 36 are constructed.展开更多
The transfer function of the optical splitting system of the acousto-optic tunable filter （AOTF） is deduced to be a reference to optical design. The characteristic matrix （transfer function） of AOTF is used to des...The transfer function of the optical splitting system of the acousto-optic tunable filter （AOTF） is deduced to be a reference to optical design. The characteristic matrix （transfer function） of AOTF is used to describe quantitatively the characters of polarization elements in the orthogonal polarizing system. According to the characteristic matrix, the included angle of polarizer′s transmission direction and polarization analyzer′s transmission direction should be 90°. As a result the signal to noise ratio increased about 20 times though the light intensity was reduced to 54.300,because both the transmittances of polarizer and polarization analyzer are 0.74, which is an intrinsic character. The orthogonal polarizing method is an effective method to get rid of the influence of zero order light and improve the spectrum resolution and signal-to-noise ratio.展开更多
We study a special class of lower trigonometric matrix value boundary value problems on hyperbolas. Firstly, the pseudo-orthogonal polynomial on hyperbola is given in bilinear form and it is shown that it is the only ...We study a special class of lower trigonometric matrix value boundary value problems on hyperbolas. Firstly, the pseudo-orthogonal polynomial on hyperbola is given in bilinear form and it is shown that it is the only one. Secondly, a special boundary value problem of lower triangular matrix is presented and transformed into four related boundary value problems. Finally, Liouville theorem and Painlevé theorem and pseudo-orthogonal polynomials are used to give solutions.展开更多
基金Supported by National Natural Science Foundation of China(Grant Nos.51575292,51475252,91648107)National Key Technology Research and Development Program of China(Grant No.2105BAF19B00)National Science and Technology Major Project of China(Grant No.2016ZX04004004)
文摘Performance index mance evaluation, and is the is the standard of perfor- foundation of both perfor- mance analysis and optimal design for the parallel manipulator. Seeking the suitable kinematic indices is always an important and challenging issue for the parallel manipulator. So far, there are extensive studies in this field, but few existing indices can meet all the requirements, such as simple, intuitive, and universal. To solve this problem, the matrix orthogonal degree is adopted, and generalized transmission indices that can evaluate motion/force trans- missibility of fully parallel manipulators are proposed. Transmission performance analysis of typical branches, end effectors, and parallel manipulators is given to illus- trate proposed indices and analysis methodology. Simula- tion and analysis results reveal that proposed transmission indices possess significant advantages, such as normalized finite （ranging from 0 to l）, dimensionally homogeneous, frame-free, intuitive and easy to calculate. Besides, pro- posed indices well indicate the good transmission region and relativity to the singularity with better resolution than the traditional local conditioning index, and provide a novel tool for kinematic analysis and optimal design of fully parallel manipulators.
文摘In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.
基金RFDP of Higher Education(20060486001)NNSF of China(10471107)
文摘In this article, the author characterizes orthogonal polynomials on an arbitrary smooth Jordan curve by a semi-conjugate matrix boundary value problem, which is different from the Riemann-Hilbert problems that appear in the theory of Riemann -Hilbert approach to asymptotic analysis for orthogonal polynomials on a real interval introduced by Fokas, Its, and Kitaev and on the unit circle introduced by Baik, Deift, and Johansson. The author hopes that their characterization may be applied to asymptotic analysis for general orthogonal polynomials by combining with a new extension of steepest descent method which we are looking for.
文摘In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.
基金Supported by the Natural Science Foundation of Henan（0211044800）
文摘In this paper,we introduce matrix-valued multiresolution analysis and orthogonal matrix-valued wavelets.We obtain a necessary and sufficient condition on the existence of orthogonal matrix-valued wavelets by means of paraunitary vector filter bank theory.A method for constructing a class of compactly supported orthogonal matrix-valued wavelets is proposed by using multiresolution analysis method and matrix theory.
基金Supported by the National Natural Science Foundation of China(No.10571122)the Beijing Natural Science Foundation(No.1052006)+1 种基金the Project of Excellent Young Teachersthe Doctoral Programme Foundation of National Education Ministry of China
文摘让 { L n (一，位)(x)} n ? 0 是定义在上的 monic Laguerre 矩阵多项式的顺序[0，鈭吗？
文摘Given a positive definite matrix measure Ω supported on the unit circle T, then main purpose of this paper is to study the asymptotic behavior of L n()L n(Ω) -1 and Φ n(z;)Φ n(z;Ω) -1 where(z)=Ω(z)+Mδ(z-w); |w|>1,M is a positive definite matrix and δ is the Dirac matrix measure. Here, L n(·) means the leading coefficient of the orthonormal matrix polynomials Φ n(z;·). Finally, we deduce the asymptotic behavior of Φ n(w;)Φ n(w;Ω)* in the case when M=I.
基金Supported by National Science Foundation of China(No.60904070,61272032)the Natural Science Foundation of Zhejiang Province(No.LY12F02002,Y1111101)
文摘UE-Brzier （unified and extended Brzier） basis is the unified form of Brzier-like bases, including polynomial Brzier basis, trigonometric polynomial and hyperbolic polynomial Brzier basis. Similar to the original Brzier-like bases, UE-Brzier basis func-tions are not orthogonal. In this paper, a group of orthogonal basis is constructed based on UE-Brzier basis. The transformation matrices between UE-Brzier basis and the proposed orthogonal basis are also solved.
文摘Matrix expression of finite orthogonal wavelet transform of finite impulse response signal is more valuable for theoretical analysis and understanding. However, clear deduction for matrix expression has not been provided yet. In this paper, the formulation to generate the re-lated matrix is put forward and the theorem on the orthogonality of this matrix proved. This effort deploys a basis for more deeper and wider applications in chemical processes. *
文摘Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-1)-flat is associated with a point in PG(m-1, sn). An orthogonal array Lsmn((sn)(smn-)(sn-1) can be constructed by using (smn-1)/( sn-1) points in PG(m-1, sn). A set of (st-1)/(s-1) points in PG(m-1, sn) is called a (t-1)-flat over GF(s) if it is isomorphic to PG(t-1, s). If there exists a (t-1)-flat over GF(s) in PG(m-1, sn), then we can replace the corresponding [(st-1)/(s-1)] sn-level columns in Lsmn((sn)(smn-)(sn-1) by (smn-1)/( sn-1) st -level columns and obtain a mixed orthogonal array. Many new mixed orthogonal arrays can be obtained by this procedure. In this paper, we study methods for finding disjoint (t-1)-flats over GF(s) in PG(m-1, sn) in order to construct more mixed orthogonal arrays of strength two. In particular, if m and n are relatively prime then we can construct an Lsmn((sm)smn-1/sm-1-i(sn-1)/ (s-1)( sn) i(sm-1)/ s-1) for any 0i(smn-1)(s-1)/( sm-1)( sn-1) New orthogonal arrays of sizes 256, 512, and 1024 are obtained by using PG(7,2), PG(8,2), and PG(9,2) respectively.
基金the National Natural Science Foundation of China(6 9972 0 3 6 ) and Foundation of the National Social Science Plan in China (97BTJ0 0 2 )
文摘A method of constructing orthogonal arrays is presented by Zhang, Lu and Pang in 1999.In this paper,the method is developed by introducing a replacement scheme on the construction of orthogonal arrays ,and some new mixed-level orthogonal arrays of run size 36 are constructed.
基金the Science Research Foundation of Education Department of ShaanxiProvince (08JK340)the Items of Xi’an University of Architecture and Technology(RC0701JC0718)
文摘The transfer function of the optical splitting system of the acousto-optic tunable filter （AOTF） is deduced to be a reference to optical design. The characteristic matrix （transfer function） of AOTF is used to describe quantitatively the characters of polarization elements in the orthogonal polarizing system. According to the characteristic matrix, the included angle of polarizer′s transmission direction and polarization analyzer′s transmission direction should be 90°. As a result the signal to noise ratio increased about 20 times though the light intensity was reduced to 54.300,because both the transmittances of polarizer and polarization analyzer are 0.74, which is an intrinsic character. The orthogonal polarizing method is an effective method to get rid of the influence of zero order light and improve the spectrum resolution and signal-to-noise ratio.
文摘We study a special class of lower trigonometric matrix value boundary value problems on hyperbolas. Firstly, the pseudo-orthogonal polynomial on hyperbola is given in bilinear form and it is shown that it is the only one. Secondly, a special boundary value problem of lower triangular matrix is presented and transformed into four related boundary value problems. Finally, Liouville theorem and Painlevé theorem and pseudo-orthogonal polynomials are used to give solutions.
