default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSongxin Liang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c6]Hongyan Wang, Zhixun Su
, Songxin Liang:
Structure-Preserving Guided Image Filtering. IScIDE (1) 2019: 114-127- 2018
- [j12]Xiaolong Zhang, Li Zou, Songxin Liang, Cheng Liu:
A novel analytic approximation method with a convergence acceleration parameter for solving nonlinear problems. Commun. Nonlinear Sci. Numer. Simul. 56: 354-364 (2018) - [j11]Hongyan Wang, Jin-shan Pan, Zhixun Su, Songxin Liang:
Blind image deblurring using elastic-net based rank prior. Comput. Vis. Image Underst. 168: 157-171 (2018) - 2017
- [j10]Xiaolong Zhang, Songxin Liang, Li Zou:
Uniqueness and error estimates for solutions to higher-order boundary value problems. J. Comput. Appl. Math. 321: 44-59 (2017) - 2016
- [c5]Hongyan Wang, Jin-shan Pan, Zhixun Su, Songxin Liang:
Blind Image Deblurring Using Elastic-Net Based Rank Prior. ACCV Workshops (1) 2016: 3-17 - 2015
- [j9]Xiaolong Zhang, Songxin Liang:
Adomian decomposition method is a special case of Lyapunov's artificial small parameter method. Appl. Math. Lett. 48: 177-179 (2015) - 2014
- [j8]Songxin Liang, Sijia Liu:
An open problem on the optimality of an asymptotic solution to Duffing's nonlinear oscillation problem. Commun. Nonlinear Sci. Numer. Simul. 19(12): 4189-4195 (2014) - [j7]Songxin Liang, Junchi Ma:
Laplace transform for the solution of higher order deformation equations arising in the homotopy analysis method. Numer. Algorithms 67(1): 49-57 (2014) - 2011
- [j6]Songxin Liang, David J. Jeffrey:
An analytical approach for solving nonlinear boundary value problems in finite domains. Numer. Algorithms 56(1): 93-106 (2011) - 2010
- [j5]Songxin Liang, David J. Jeffrey:
Approximate solutions to a parameterized sixth order boundary value problem. Comput. Math. Appl. 59(1): 247-253 (2010)
2000 – 2009
- 2009
- [j4]Songxin Liang, David J. Jeffrey:
New travelling wave solutions to modified CH and DP equations. Comput. Phys. Commun. 180(9): 1429-1433 (2009) - [j3]Songxin Liang, David J. Jeffrey:
An efficient analytical approach for solving fourth order boundary value problems. Comput. Phys. Commun. 180(11): 2034-2040 (2009) - [j2]Songxin Liang, David J. Jeffrey:
Automatic computation of the complete root classification for a parametric polynomial. J. Symb. Comput. 44(10): 1487-1501 (2009) - 2008
- [j1]Songxin Liang, David J. Jeffrey:
Automatic computation of the travelling wave solutions to nonlinear PDEs. Comput. Phys. Commun. 178(9): 700-712 (2008) - [c4]Songxin Liang, David J. Jeffrey, Marc Moreno Maza:
The complete root classification of a parametric polynomial on an interval. ISSAC 2008: 189-196 - 2007
- [c3]Songxin Liang, David J. Jeffrey:
Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact. ASCM 2007: 22-31 - [c2]Songxin Liang, David J. Jeffrey:
Rule-Based Simplification in Vector-Product Spaces. Calculemus/MKM 2007: 116-127 - 2006
- [c1]Songxin Liang, David J. Jeffrey:
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial. AISC 2006: 116-130
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
