2018
DOI: 10.1007/978-3-030-00006-6_12
|View full text |Cite
|
Sign up to set email alerts
|

A Modified Dai-Yuan Conjugate Gradient Algorithm for Large-Scale Optimization Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…Two crystalline CuZr supercells are prepared using ATOMSK [61], the B 2 -Cu 50 Zr 50 , C11 b -Cu 33.3 Zr 66.7 of dimension 9.69×3.55×3.55 nm 3 and 3.56×3.56×12.35 nm 3 respectively. The energy of the B2 and C11 b are minimized and relaxed using the conjugate gradient algorithm [62]. The system is then replicated along the three directions of space up to a size of about 1092 × 15 × 15 nm 3 .…”
Section: B Samples Elaborationmentioning
confidence: 99%
“…Two crystalline CuZr supercells are prepared using ATOMSK [61], the B 2 -Cu 50 Zr 50 , C11 b -Cu 33.3 Zr 66.7 of dimension 9.69×3.55×3.55 nm 3 and 3.56×3.56×12.35 nm 3 respectively. The energy of the B2 and C11 b are minimized and relaxed using the conjugate gradient algorithm [62]. The system is then replicated along the three directions of space up to a size of about 1092 × 15 × 15 nm 3 .…”
Section: B Samples Elaborationmentioning
confidence: 99%