Accurate least-squares P scaling based on problem optical thickness for solving neutron transport problems

Zheng, Weixiong; McClarren, Ryan G.

doi:10.1016/j.pnucene.2017.06.001

Title: Accurate least-squares P scaling based on problem optical thickness for solving neutron transport problems

Full Record
Other Related Research

Authors:

Zheng, Weixiong;

Publication Date:: Wed Nov 01 00:00:00 EDT 2017

Sponsoring Org.:: USDOE

OSTI Identifier:: 1550211

Grant/Contract Number:: C12-00281

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Progress in Nuclear Energy

Additional Journal Information:: Journal Name: Progress in Nuclear Energy Journal Volume: 101 Journal Issue: PC; Journal ID: ISSN 0149-1970

Publisher:: Elsevier

Country of Publication:: United Kingdom

Language:: English

Citation Formats


                    Zheng, Weixiong, and McClarren, Ryan G. Accurate least-squares P scaling based on problem optical thickness for solving neutron transport problems.  United Kingdom: N. p., 2017. 
Web.  doi:10.1016/j.pnucene.2017.06.001.

Copy to clipboard


                    Zheng, Weixiong, & McClarren, Ryan G. Accurate least-squares P scaling based on problem optical thickness for solving neutron transport problems.  United Kingdom.  https://doi.org/10.1016/j.pnucene.2017.06.001

Copy to clipboard


                    Zheng, Weixiong, and McClarren, Ryan G. Wed .  
"Accurate least-squares P scaling based on problem optical thickness for solving neutron transport problems".  United Kingdom.  https://doi.org/10.1016/j.pnucene.2017.06.001.

Copy to clipboard


                    
@article{osti_1550211,

  title        = {Accurate least-squares P scaling based on problem optical thickness for solving neutron transport problems},

  author       = {Zheng, Weixiong and McClarren, Ryan G.},

  abstractNote = {},

  doi          = {10.1016/j.pnucene.2017.06.001},

  journal      = {Progress in Nuclear Energy},

  number       = PC,

  volume       = 101,

  place        = {United Kingdom},

  year         = {Wed Nov 01 00:00:00 EDT 2017},

  month        = {Wed Nov 01 00:00:00 EDT 2017}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.pnucene.2017.06.001

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 6 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Adjacent-cell Preconditioners for solving optically thick neutron transport problems

Conference Azmy, Y Y

We develop, analyze, and test a new acceleration scheme for neutron transport methods, the Adjacent-cell Preconditioner (AP) that is particularly suited for solving optically thick problems. Our method goes beyond Diffusion Synthetic Acceleration (DSA) methods in that it`s spectral radius vanishes with increasing cell thickness. In particular, for the ID case the AP method converges immediately, i.e. in one iteration, to 10{sup {minus}4} pointwise relative criterion in problems with dominant cell size of 10 mfp or thicker. Also the AP has a simple formalism and is cell-centered hence, multidimensional and high order extensions are easier to develop, and more efficientmore » to implement.« less
Full Text Available
Some new preconditioned generalized AOR methods for solving weighted linear least squares problems

Journal Article Huang, Zheng-Ge ; Wang, Li-Gong ; Xu, Zhong ; ... - Computational and Applied Mathematics

In this paper, we propose some new preconditioned GAOR methods for solving weighted linear least squares problems and discuss their comparison results. Comparison results show that the convergence rates of the new preconditioned GAOR methods are better than those of the preconditioned GAOR methods presented by Shen et al. (Appl Math Mech Engl Ed 33(3):375–384, 2012) and Wang et al. (J Appl Math, doi: 10.1155/2012/563586 , 2012) whenever these methods are convergent. Finally, numerical experiments are provided to confirm the theoretical results obtained in this paper.
https://doi.org/10.1007/S40314-016-0350-8
Comparison of some methods for solving sparse linear least squares problems

Technical Report George, A ; Heath, M T ; Ng, E

The method of normal equations, the Peters-Wilkinson algorithm and an algorithm based on Givens rotations for solving large sparse linear least squares problems are discussed and compared. Numerical experiments show that the method of normal equations should be considered when the observation-matrix is sparse and numerical stability is not important. However, if numerical stability is a major issue, the algorithm based on Givens rotations is then preferable.
Comparison of some methods for solving sparse linear least-squares problems

Journal Article George, A ; Heath, M T ; Ng, E - SIAM J. Sci. Stat. Comput.; (United States)

The method of normal equations, the Peters-Wilkinson algorithm and an algorithm based on Givens rotations for solving large sparse linear least squares problems are discussed and compared. Numerical experiments show that the method of normal equations should be considered when the observation matrix is sparse and well conditioned. For ill-conditioned problems, the algorithm based on Givens rotations is preferable.
https://doi.org/10.1137/0904013
A continuation approach for solving large-residual nonlinear least squares problems

Journal Article Salane, D E - SIAM J. Sci. Stat. Comput.; (United States)

This paper is concerned with the solution of the nonlinear least squares problem. A continuation method is used to develop a new framework for the model trust region approach for solving nonlinear least squares problems. This framework gives a motivation for the direct selection of the trust region parameter. It also provides a natural safeguard for trust region methods and leads to a very robust algorithm. A class of algorithms based on the continuation method is presented. In addition, the implementation details for one member of the new class are examined. The convergence and descent properties of this algorithm aremore »« less
https://doi.org/10.1137/0908058

Similar Records