Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 49 papers published in subject: since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Wavelet characterization for multipliers on Sobolev spaces | |||
Yang Qixiang | |||
Mathematics 02 April 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Multipliers on Sobolev spaces have been studied heavily in 1980s and stay always as an active topic. Before, one used the capacity of compact set on Sobolev spaces to characterize multiplier spaces and to study the applications related to multiplier spaces, one did not know even they have unconditional basis or not. Here wavelet methods are introduced, the structure of multiplier spaces is analyzed through the following conceptions: some special decomposition of product of functions, Morrey spaces, known wavelet characterization of certain function spaces, dual and the relations between function spaces; and the conclusion of the elements of multiplier spaces are determined by the absolute value of their wavelet coefficient is drawed. | |||
TO cite this article:Yang Qixiang. Wavelet characterization for multipliers on Sobolev spaces[OL].[ 2 April 2010] http://en.paper.edu.cn/en_releasepaper/content/41508 |
2. Symbolic Computation for Parametrized Wavelets in SAGE | |||
Wang Le | |||
Mathematics 17 December 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, author mainly discusses parametrizing filter coefficients for wavelets in the open-source computer algebra system SAGE. We first recall the general ideas of wavelets construction and then we discuss how to solve wavelet design problems by using symbolic methods, in particular Groebner bases, for compactly supported orthonormal wavelets. Second, We make a brief review of the ideas of Regensburger and Scherzer for parametrizing compactly supported orthonormal wavelets by discrete moments and introduce the parametrization procedures for orthonormal wavelets with the corresponding functions defined in SAGE and analyze the solutions by using different reduction order during the symbolic computation. Complete solutions and analysis for parametrized filter coefficients of length eight in the orthonormal case are presented. | |||
TO cite this article:Wang Le. Symbolic Computation for Parametrized Wavelets in SAGE[OL].[17 December 2009] http://en.paper.edu.cn/en_releasepaper/content/37659 |
3. An optimal system and some group-invariant solutions of the Benney equation | |||
Yang Shangrong | |||
Mathematics 14 December 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:By using lie group method the Benney equation is studied. Its one-parameter Lie point symmetries and adjoint representations are obtained. An optimal system of one-dimensional subalgebras is derived and used to construct some special closed-form solutions of the equation with the help of G‘/G-expansion method. | |||
TO cite this article:Yang Shangrong. An optimal system and some group-invariant solutions of the Benney equation[OL].[14 December 2009] http://en.paper.edu.cn/en_releasepaper/content/37538 |
4. Stable- Proximal Iterative Algorithms for General Mixed Variational Inequalities | |||
Xing Cui | |||
Mathematics 04 September 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper is mainly considered the algorithms of generalized mixed quasi-variational inequality,where the algorithms is based on the projection methods. We presents a stable- proximal iterative algorithm for general mixed variational inequalities which has a set-valued mapping for finding the common element, by finding fixed point of nonexpansion mappings and the set of solutions of generalized mixed variational inequalities. Moreover, we also discuss the convergence criteria. | |||
TO cite this article:Xing Cui. Stable- Proximal Iterative Algorithms for General Mixed Variational Inequalities[OL].[ 4 September 2009] http://en.paper.edu.cn/en_releasepaper/content/34905 |
5. Some New Results On The 3x+1 Problem | |||
Jiang Yu,Wu Dongliang,Wei Lili,Zhao Dongfang | |||
Mathematics 22 July 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we mainly discussed the open hard 3x+1 problem. We given a more integrate and abundant table than the one that given by R.E.Crandall and validated the height is finite for all m not greater than 2^(60) via professional mathematics software --Mathematica5.0. Besides, we also found some interesting phenomenons. | |||
TO cite this article:Jiang Yu,Wu Dongliang,Wei Lili, et al. Some New Results On The 3x+1 Problem[OL].[22 July 2009] http://en.paper.edu.cn/en_releasepaper/content/34008 |
6. On the stability of unstable difference equations | |||
Guo Shaoming | |||
Mathematics 06 July 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we focus on the first order difference equation x(n+1)-x(n)=f(n,x(n)) and get some sufficient conditions concerning uniform stability, convergence and divergence. Applying these conditions, we discuss further in detail some properties of the equation x(n+1)-x(n)=x(n)^a/n^b. | |||
TO cite this article:Guo Shaoming . On the stability of unstable difference equations[OL].[ 6 July 2009] http://en.paper.edu.cn/en_releasepaper/content/33638 |
7. On the iterative bisymmetric solution of general coupled matrix equations | |||
Li Dongping,Miao Shuxin ,Zheng Bing | |||
Mathematics 05 May 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A matrix A = (ai;j) 2 Rn×n is called bisymmetric matrix if ai;j = aj;i =an+1-j;n+1-i holds for all 1≤i; j≤n. In this paper, an efficient algorithm is presented to find the bisymmetric solution of the general coupled matrix equations. When the general coupled matrix equations is consistent on bisymmetric solutions, then for any initial bisymmetric matrix group, a group of bisymmetric solution can be obtained within finite iterative steps in the absence of round off errors, and the least norm bisymmetric solution can be obtained by choosing a group of special kind of initial matrices. Finally, we test the algorithm and show it is effectiveness by a numerical example. | |||
TO cite this article:Li Dongping,Miao Shuxin ,Zheng Bing . On the iterative bisymmetric solution of general coupled matrix equations[OL].[ 5 May 2009] http://en.paper.edu.cn/en_releasepaper/content/31935 |
8. A Combined Homotopy Method for Solving Horizontal Linear | |||
JUNYAN XU,ZHUANG MIAO,QINGHUAI LIU | |||
Mathematics 20 April 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A global convergence combined homotopy method for solving horizontal linear complementarity problem has been introduced in this paper. We give the combined homotopy equation and prove in details the existence of the smooth path from almost any interior initial point to a solution of HLCP ( , , ). We give several preliminary numerical results. Numerical results are presented to show the effectiveness of this method. | |||
TO cite this article:JUNYAN XU,ZHUANG MIAO,QINGHUAI LIU. A Combined Homotopy Method for Solving Horizontal Linear[OL].[20 April 2009] http://en.paper.edu.cn/en_releasepaper/content/31550 |
9. A New Online Algorithm for Multiclass of SVM | |||
zhang leilei,Sheng Baohuai | |||
Mathematics 25 March 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In the present paper we provide a new algorithm for muticlass vector machines. Our starting point is a generalized notion of the maximal margin to multiclass problems. Using this notion we cast the muticlass problem as a binary classification task every time. So we combine a new classification function with the approximate maximal margin algorithm which is devised for binary classification.Our algorithm needs O( (p−1) α2γ2 ) corrections every time to separate the data with p-norm margin larger than l(1 − α)γ, with γ being the p-norm margin of the data. | |||
TO cite this article:zhang leilei,Sheng Baohuai. A New Online Algorithm for Multiclass of SVM[OL].[25 March 2009] http://en.paper.edu.cn/en_releasepaper/content/30712 |
10. Energy change of Bipartite unicyclic graph with k | |||
chen zhiwen | |||
Mathematics 19 March 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:G is a (molecular)graph,its energy ,denoted by E(G),is definedto be the absolute values of all eigenvalues of adjacency matrix of G.Let ɡ2l,r,k1,k2 (k1 ≥k2≥ 0) the graph obtained by attaching k1 And k2 pendent edges to the first vertex and the r-th vertex of the cycle Cl,respectively.Wecharacterized energy change and the extremalenergy graphs in ɡ2l,r,k1,k2 (k1 ≥k2≥ 0). | |||
TO cite this article:chen zhiwen. Energy change of Bipartite unicyclic graph with k[OL].[19 March 2009] http://en.paper.edu.cn/en_releasepaper/content/30509 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated