SlideShare a Scribd company logo
1 of 18
Group Members
Aakash Rajper 1381-FET/BSEE/F-10
Abdul Haseeb 1382-FET/BSEE/F-10
Badar Jahangee 1383-FET/BSEE/F-10
Danish Javed 1384-FET/BSEE/F-10
Hamza Arshad 1382-FET/BSEE/F-10
 Used for modeling devices.
 Devices are modeled in ATLAS by a set of one to six
PDEs.
 These PDEs are converted to approx. non-linear then
linear algebraic equations.
 These equations are solved iteratively until a solution
nearest to real values are achieved.
 Values for unknowns are calculated at mesh points.
 Different solution procedures exhibit different
behavior with respect to convergence, accuracy,
efficiency, and robustness.
 The two main aspects of convergence are whether a
solution is obtained and how rapidly it is approached.
 Accuracy is how closely the computed solution
approximates the true solution.
 Efficiency is the time required to produce a solution.
 Robustness is the ability of a technique or method to
cope with errors during execution.
 Different methods can work better for different
problems. Atlas has captured practical experience in
the form of default methods and parameters that work
well in almost all circumstances.
 Numerical Methods are given in the METHOD statements of the
input file.
Example “METHOD GUMMEL NEWTON”
 There are three types of solution techniques.
1. Decoupled (GUMMEL)
Gummel method will solve for each unknown in turn keeping
the other variables constant, repeating the process until a
stable solution is achieved.
2. Fully coupled (NEWTON)
Newton method solve the total system of unknowns together.
3. BLOCK
Block method will solve some equations fully-coupled while
others are decoupled.
 A coupled system is formed by two differential
equations with two dependent variables and one
independent variable.
 For example:
𝑑𝑦(𝑡)
𝑑𝑥(𝑡)
= 𝑎𝑥(𝑡) + 𝑏𝑦(𝑡)
𝑑𝑥(𝑡)
𝑑𝑡
= 𝑐𝑥(𝑡) + 𝑑𝑦(𝑡)
a, b, c and d are constants while x and y are functions of t
 In decoupled system one variable is solved while other
are kept constant.
 For example
𝜕𝑦(𝑡)
𝜕𝑡
= 𝑎𝑦 𝑡 + 𝑏𝑥(𝑡)
𝜕𝑥(𝑡)
𝜕𝑡
= 𝑐𝑦 𝑡 + 𝑑𝑥(𝑡)
a, b, c and d are constants while x and y are functions of t
 Gummel Method
 Weakly coupled system of equations
 Linear convergence
 Provide better initial guess
 Newton Method
 Strongly coupled system of equations
 Quadratic convergence
 May spend extra time
 Requires more accurate initial guess
 Block Method
 Provide faster simulation time
 Useful to start with few Gummel iterations
 Then switch to Newton to complete the solution
 Generates better guess
 We compare the performance of algorithm by their
rate of convergence.
 This model requires the solution of three equations for
 Potential
 Electron Concentration
 Hole concentration
 For almost all cases NEWTON method is preferred
and it is the default.
 Block method in this model is robust but more time
consuming.
 Block method is highly recommended for all
simulations with floating regions (e.g., SOI
transistors)
 Extra equation is added when Latice heating model is
added to drift diffusion
 If we apply Block Method in this level it’ll solve three
eq. by Newton and fourth with Gummel.
 Newton Method solves all four equations in a coupled
manner.
 Newton is preferred for high temp. while Block is used
for low temp. gradients
 It requires solution of up to five coupled equations.
 Newton and Gummel have same meaning for this
model
 Block performs coupled solutions for all five equations
 We can switch from Block to Newton for robust
performance.
 The switching point is pre-determined.
 It can be changed in the METHOD statement.
 Requires six equations system.
 Gummel and Newton solve the equations iteratively.
 Block functions initially performs the same as energy
balance and performs lattice heating equation in
decoupled manner.
 Old Syntax New Syntax
 Symbolic newton Method newton
 Symbolic gummel Method gummel
 All numeric settings chosen on METHOD statement
 All structure/parameter specification must be before this statement.
 All solution specification must be after it.
 Fully Coupled Method solves for potential and carriers coupled
(METHOD NEWTON)
 Recommended for all cases even including SOI simulations.
 De-Coupled method solves potential and carriers sequentially
(METHOD GUMMEL)
 Faster for low current cases.
 Combined method (METHOD GUMMEL NEWTON)
 Runs initial decoupled iterations and switches to coupled.
 GUM.INIT parameter controls the number of initial decoupled
iterations.
 most robust (but slowest) method.
 Atlas can solve both electron and hole continuity
equation.
 We can make this choice by using CARRIER
parameters.
 METHOD CARRIER = 2
 Specifies, when a solution for both carriers is required.
 This method is default.
 METHOD CARRIER = 1 HOLE
 For one carrier either electron or hole.
 METHOD CARRIER = 0
 For potential only.
 The following cases require ‘METHOD NEWTON
CARRIER = 2’ to be set for isothermal drift diffusion
simulations
 Current boundary conditions
 Distributed or Lumped external elements
 AC analysis
 Impact ionization
 Both Block or Newton are permitted for lattice heat
and energy balance.
B-G-3
B-G-3

More Related Content

What's hot

A Comparative Study of Acoustic Echo Cancellation Algorithms in Sparse Impuls...
A Comparative Study of Acoustic Echo Cancellation Algorithms in Sparse Impuls...A Comparative Study of Acoustic Echo Cancellation Algorithms in Sparse Impuls...
A Comparative Study of Acoustic Echo Cancellation Algorithms in Sparse Impuls...IJERA Editor
 
A simple finite element solver for thermo-mechanical problems - margonari eng...
A simple finite element solver for thermo-mechanical problems - margonari eng...A simple finite element solver for thermo-mechanical problems - margonari eng...
A simple finite element solver for thermo-mechanical problems - margonari eng...Scilab
 
A-Hybrid-Approach-Using-Particle-Swarm-Optimization-and-Simulated-Annealing-f...
A-Hybrid-Approach-Using-Particle-Swarm-Optimization-and-Simulated-Annealing-f...A-Hybrid-Approach-Using-Particle-Swarm-Optimization-and-Simulated-Annealing-f...
A-Hybrid-Approach-Using-Particle-Swarm-Optimization-and-Simulated-Annealing-f...Pourya Jafarzadeh
 
MTH101 - Calculus and Analytical Geometry- Lecture 43
MTH101 - Calculus and Analytical Geometry- Lecture 43MTH101 - Calculus and Analytical Geometry- Lecture 43
MTH101 - Calculus and Analytical Geometry- Lecture 43Bilal Ahmed
 
Hall 2006 problems-encounteredfromuserayleighdamping
Hall 2006 problems-encounteredfromuserayleighdampingHall 2006 problems-encounteredfromuserayleighdamping
Hall 2006 problems-encounteredfromuserayleighdampingJuan Camacho
 
On Vector Functions With A Parameter
On Vector Functions With A ParameterOn Vector Functions With A Parameter
On Vector Functions With A ParameterQUESTJOURNAL
 
Receptor kinetics Laplace transform method Word
Receptor kinetics Laplace transform method WordReceptor kinetics Laplace transform method Word
Receptor kinetics Laplace transform method WordSam Hoare
 
Application of differential equation in real life
Application of differential equation in real   lifeApplication of differential equation in real   life
Application of differential equation in real lifeTanjil Hasan
 
Novel analysis of transition probabilities in randomized k sat algorithm
Novel analysis of transition probabilities in randomized k sat algorithmNovel analysis of transition probabilities in randomized k sat algorithm
Novel analysis of transition probabilities in randomized k sat algorithmijfcstjournal
 
T coffee algorithm dissection
T coffee algorithm dissectionT coffee algorithm dissection
T coffee algorithm dissectionGui Chen
 
Regression in Modal Logic
Regression in Modal LogicRegression in Modal Logic
Regression in Modal LogicIvan Varzinczak
 
Prime and Composite Numbers
Prime and Composite NumbersPrime and Composite Numbers
Prime and Composite NumbersSonny Soriano
 
Parellelism in spectral methods
Parellelism in spectral methodsParellelism in spectral methods
Parellelism in spectral methodsRamona Corman
 
Density Functional Theory
Density Functional TheoryDensity Functional Theory
Density Functional Theorykrishslide
 

What's hot (19)

A Comparative Study of Acoustic Echo Cancellation Algorithms in Sparse Impuls...
A Comparative Study of Acoustic Echo Cancellation Algorithms in Sparse Impuls...A Comparative Study of Acoustic Echo Cancellation Algorithms in Sparse Impuls...
A Comparative Study of Acoustic Echo Cancellation Algorithms in Sparse Impuls...
 
maths.ppt
maths.pptmaths.ppt
maths.ppt
 
A simple finite element solver for thermo-mechanical problems - margonari eng...
A simple finite element solver for thermo-mechanical problems - margonari eng...A simple finite element solver for thermo-mechanical problems - margonari eng...
A simple finite element solver for thermo-mechanical problems - margonari eng...
 
[Book Reading] 機械翻訳 - Section 2 No.2
 [Book Reading] 機械翻訳 - Section 2 No.2 [Book Reading] 機械翻訳 - Section 2 No.2
[Book Reading] 機械翻訳 - Section 2 No.2
 
A-Hybrid-Approach-Using-Particle-Swarm-Optimization-and-Simulated-Annealing-f...
A-Hybrid-Approach-Using-Particle-Swarm-Optimization-and-Simulated-Annealing-f...A-Hybrid-Approach-Using-Particle-Swarm-Optimization-and-Simulated-Annealing-f...
A-Hybrid-Approach-Using-Particle-Swarm-Optimization-and-Simulated-Annealing-f...
 
MTH101 - Calculus and Analytical Geometry- Lecture 43
MTH101 - Calculus and Analytical Geometry- Lecture 43MTH101 - Calculus and Analytical Geometry- Lecture 43
MTH101 - Calculus and Analytical Geometry- Lecture 43
 
Hall 2006 problems-encounteredfromuserayleighdamping
Hall 2006 problems-encounteredfromuserayleighdampingHall 2006 problems-encounteredfromuserayleighdamping
Hall 2006 problems-encounteredfromuserayleighdamping
 
Presentation
PresentationPresentation
Presentation
 
On Vector Functions With A Parameter
On Vector Functions With A ParameterOn Vector Functions With A Parameter
On Vector Functions With A Parameter
 
Receptor kinetics Laplace transform method Word
Receptor kinetics Laplace transform method WordReceptor kinetics Laplace transform method Word
Receptor kinetics Laplace transform method Word
 
Application of differential equation in real life
Application of differential equation in real   lifeApplication of differential equation in real   life
Application of differential equation in real life
 
Novel analysis of transition probabilities in randomized k sat algorithm
Novel analysis of transition probabilities in randomized k sat algorithmNovel analysis of transition probabilities in randomized k sat algorithm
Novel analysis of transition probabilities in randomized k sat algorithm
 
T coffee algorithm dissection
T coffee algorithm dissectionT coffee algorithm dissection
T coffee algorithm dissection
 
Regression in Modal Logic
Regression in Modal LogicRegression in Modal Logic
Regression in Modal Logic
 
Prime and Composite Numbers
Prime and Composite NumbersPrime and Composite Numbers
Prime and Composite Numbers
 
Levenberg - Marquardt (LM) algorithm_ aghazade
Levenberg - Marquardt (LM) algorithm_ aghazadeLevenberg - Marquardt (LM) algorithm_ aghazade
Levenberg - Marquardt (LM) algorithm_ aghazade
 
Parellelism in spectral methods
Parellelism in spectral methodsParellelism in spectral methods
Parellelism in spectral methods
 
Density Functional Theory
Density Functional TheoryDensity Functional Theory
Density Functional Theory
 
Plan economico
Plan economicoPlan economico
Plan economico
 

Similar to B-G-3

An Efficient Tangent Scheme For Solving Phase-Change Problems
An Efficient Tangent Scheme For Solving Phase-Change ProblemsAn Efficient Tangent Scheme For Solving Phase-Change Problems
An Efficient Tangent Scheme For Solving Phase-Change ProblemsDarian Pruitt
 
Simulated Annealing - A Optimisation Technique
Simulated Annealing - A Optimisation TechniqueSimulated Annealing - A Optimisation Technique
Simulated Annealing - A Optimisation TechniqueAUSTIN MOSES
 
A Self-Tuned Simulated Annealing Algorithm using Hidden Markov Mode
A Self-Tuned Simulated Annealing Algorithm using Hidden Markov ModeA Self-Tuned Simulated Annealing Algorithm using Hidden Markov Mode
A Self-Tuned Simulated Annealing Algorithm using Hidden Markov ModeIJECEIAES
 
2011 santiago marchi_souza_araki_cobem_2011
2011 santiago marchi_souza_araki_cobem_20112011 santiago marchi_souza_araki_cobem_2011
2011 santiago marchi_souza_araki_cobem_2011CosmoSantiago
 
A Framework for Self-Tuning Optimization Algorithm
A Framework for Self-Tuning Optimization AlgorithmA Framework for Self-Tuning Optimization Algorithm
A Framework for Self-Tuning Optimization AlgorithmXin-She Yang
 
Introduction to finite element method
Introduction to finite element methodIntroduction to finite element method
Introduction to finite element methodshahzaib601980
 
MOLECULAR SIMULATION TECHNIQUES
MOLECULAR SIMULATION TECHNIQUESMOLECULAR SIMULATION TECHNIQUES
MOLECULAR SIMULATION TECHNIQUESMysha Malar M
 
Parallel-in-Time Object-Oriented Electromagnetic Transient Simulation of Powe...
Parallel-in-Time Object-Oriented Electromagnetic Transient Simulation of Powe...Parallel-in-Time Object-Oriented Electromagnetic Transient Simulation of Powe...
Parallel-in-Time Object-Oriented Electromagnetic Transient Simulation of Powe...Power System Operation
 
2005 pinto santiago_marchi_cobem_2005
2005 pinto santiago_marchi_cobem_20052005 pinto santiago_marchi_cobem_2005
2005 pinto santiago_marchi_cobem_2005CosmoSantiago
 
240311_JW_labseminar[Sequence to Sequence Learning with Neural Networks].pptx
240311_JW_labseminar[Sequence to Sequence Learning with Neural Networks].pptx240311_JW_labseminar[Sequence to Sequence Learning with Neural Networks].pptx
240311_JW_labseminar[Sequence to Sequence Learning with Neural Networks].pptxthanhdowork
 
SimulatedAnnealing.ppt
SimulatedAnnealing.pptSimulatedAnnealing.ppt
SimulatedAnnealing.pptVivekChawla19
 
Genetic Algorithm for Solving the Economic Load Dispatch
Genetic Algorithm for Solving the Economic Load DispatchGenetic Algorithm for Solving the Economic Load Dispatch
Genetic Algorithm for Solving the Economic Load DispatchSatyendra Singh
 
computationalchemistry_12-6.ppt
computationalchemistry_12-6.pptcomputationalchemistry_12-6.ppt
computationalchemistry_12-6.pptsami97008
 
Product failure analysis using Explicit dynamic
Product failure analysis using Explicit dynamicProduct failure analysis using Explicit dynamic
Product failure analysis using Explicit dynamicnaga ram
 
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...IJORCS
 

Similar to B-G-3 (20)

An Efficient Tangent Scheme For Solving Phase-Change Problems
An Efficient Tangent Scheme For Solving Phase-Change ProblemsAn Efficient Tangent Scheme For Solving Phase-Change Problems
An Efficient Tangent Scheme For Solving Phase-Change Problems
 
Simulated Annealing - A Optimisation Technique
Simulated Annealing - A Optimisation TechniqueSimulated Annealing - A Optimisation Technique
Simulated Annealing - A Optimisation Technique
 
ICRAME nishanth
ICRAME nishanthICRAME nishanth
ICRAME nishanth
 
A Self-Tuned Simulated Annealing Algorithm using Hidden Markov Mode
A Self-Tuned Simulated Annealing Algorithm using Hidden Markov ModeA Self-Tuned Simulated Annealing Algorithm using Hidden Markov Mode
A Self-Tuned Simulated Annealing Algorithm using Hidden Markov Mode
 
TO_EDIT
TO_EDITTO_EDIT
TO_EDIT
 
2011 santiago marchi_souza_araki_cobem_2011
2011 santiago marchi_souza_araki_cobem_20112011 santiago marchi_souza_araki_cobem_2011
2011 santiago marchi_souza_araki_cobem_2011
 
Some numerical methods for Schnackenberg model
Some numerical methods for Schnackenberg modelSome numerical methods for Schnackenberg model
Some numerical methods for Schnackenberg model
 
Introduction to Finite Elements
Introduction to Finite ElementsIntroduction to Finite Elements
Introduction to Finite Elements
 
A Framework for Self-Tuning Optimization Algorithm
A Framework for Self-Tuning Optimization AlgorithmA Framework for Self-Tuning Optimization Algorithm
A Framework for Self-Tuning Optimization Algorithm
 
Introduction to finite element method
Introduction to finite element methodIntroduction to finite element method
Introduction to finite element method
 
MOLECULAR SIMULATION TECHNIQUES
MOLECULAR SIMULATION TECHNIQUESMOLECULAR SIMULATION TECHNIQUES
MOLECULAR SIMULATION TECHNIQUES
 
Parallel-in-Time Object-Oriented Electromagnetic Transient Simulation of Powe...
Parallel-in-Time Object-Oriented Electromagnetic Transient Simulation of Powe...Parallel-in-Time Object-Oriented Electromagnetic Transient Simulation of Powe...
Parallel-in-Time Object-Oriented Electromagnetic Transient Simulation of Powe...
 
2005 pinto santiago_marchi_cobem_2005
2005 pinto santiago_marchi_cobem_20052005 pinto santiago_marchi_cobem_2005
2005 pinto santiago_marchi_cobem_2005
 
240311_JW_labseminar[Sequence to Sequence Learning with Neural Networks].pptx
240311_JW_labseminar[Sequence to Sequence Learning with Neural Networks].pptx240311_JW_labseminar[Sequence to Sequence Learning with Neural Networks].pptx
240311_JW_labseminar[Sequence to Sequence Learning with Neural Networks].pptx
 
SimulatedAnnealing.ppt
SimulatedAnnealing.pptSimulatedAnnealing.ppt
SimulatedAnnealing.ppt
 
Genetic Algorithm for Solving the Economic Load Dispatch
Genetic Algorithm for Solving the Economic Load DispatchGenetic Algorithm for Solving the Economic Load Dispatch
Genetic Algorithm for Solving the Economic Load Dispatch
 
computationalchemistry_12-6.ppt
computationalchemistry_12-6.pptcomputationalchemistry_12-6.ppt
computationalchemistry_12-6.ppt
 
Product failure analysis using Explicit dynamic
Product failure analysis using Explicit dynamicProduct failure analysis using Explicit dynamic
Product failure analysis using Explicit dynamic
 
Cohen
CohenCohen
Cohen
 
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...
 

B-G-3

  • 1. Group Members Aakash Rajper 1381-FET/BSEE/F-10 Abdul Haseeb 1382-FET/BSEE/F-10 Badar Jahangee 1383-FET/BSEE/F-10 Danish Javed 1384-FET/BSEE/F-10 Hamza Arshad 1382-FET/BSEE/F-10
  • 2.  Used for modeling devices.  Devices are modeled in ATLAS by a set of one to six PDEs.  These PDEs are converted to approx. non-linear then linear algebraic equations.  These equations are solved iteratively until a solution nearest to real values are achieved.  Values for unknowns are calculated at mesh points.  Different solution procedures exhibit different behavior with respect to convergence, accuracy, efficiency, and robustness.
  • 3.  The two main aspects of convergence are whether a solution is obtained and how rapidly it is approached.  Accuracy is how closely the computed solution approximates the true solution.  Efficiency is the time required to produce a solution.  Robustness is the ability of a technique or method to cope with errors during execution.  Different methods can work better for different problems. Atlas has captured practical experience in the form of default methods and parameters that work well in almost all circumstances.
  • 4.  Numerical Methods are given in the METHOD statements of the input file. Example “METHOD GUMMEL NEWTON”  There are three types of solution techniques. 1. Decoupled (GUMMEL) Gummel method will solve for each unknown in turn keeping the other variables constant, repeating the process until a stable solution is achieved. 2. Fully coupled (NEWTON) Newton method solve the total system of unknowns together. 3. BLOCK Block method will solve some equations fully-coupled while others are decoupled.
  • 5.  A coupled system is formed by two differential equations with two dependent variables and one independent variable.  For example: 𝑑𝑦(𝑡) 𝑑𝑥(𝑡) = 𝑎𝑥(𝑡) + 𝑏𝑦(𝑡) 𝑑𝑥(𝑡) 𝑑𝑡 = 𝑐𝑥(𝑡) + 𝑑𝑦(𝑡) a, b, c and d are constants while x and y are functions of t
  • 6.  In decoupled system one variable is solved while other are kept constant.  For example 𝜕𝑦(𝑡) 𝜕𝑡 = 𝑎𝑦 𝑡 + 𝑏𝑥(𝑡) 𝜕𝑥(𝑡) 𝜕𝑡 = 𝑐𝑦 𝑡 + 𝑑𝑥(𝑡) a, b, c and d are constants while x and y are functions of t
  • 7.  Gummel Method  Weakly coupled system of equations  Linear convergence  Provide better initial guess  Newton Method  Strongly coupled system of equations  Quadratic convergence  May spend extra time  Requires more accurate initial guess
  • 8.  Block Method  Provide faster simulation time  Useful to start with few Gummel iterations  Then switch to Newton to complete the solution  Generates better guess  We compare the performance of algorithm by their rate of convergence.
  • 9.  This model requires the solution of three equations for  Potential  Electron Concentration  Hole concentration  For almost all cases NEWTON method is preferred and it is the default.  Block method in this model is robust but more time consuming.  Block method is highly recommended for all simulations with floating regions (e.g., SOI transistors)
  • 10.  Extra equation is added when Latice heating model is added to drift diffusion  If we apply Block Method in this level it’ll solve three eq. by Newton and fourth with Gummel.  Newton Method solves all four equations in a coupled manner.  Newton is preferred for high temp. while Block is used for low temp. gradients
  • 11.  It requires solution of up to five coupled equations.  Newton and Gummel have same meaning for this model  Block performs coupled solutions for all five equations  We can switch from Block to Newton for robust performance.  The switching point is pre-determined.  It can be changed in the METHOD statement.
  • 12.  Requires six equations system.  Gummel and Newton solve the equations iteratively.  Block functions initially performs the same as energy balance and performs lattice heating equation in decoupled manner.
  • 13.  Old Syntax New Syntax  Symbolic newton Method newton  Symbolic gummel Method gummel
  • 14.  All numeric settings chosen on METHOD statement  All structure/parameter specification must be before this statement.  All solution specification must be after it.  Fully Coupled Method solves for potential and carriers coupled (METHOD NEWTON)  Recommended for all cases even including SOI simulations.  De-Coupled method solves potential and carriers sequentially (METHOD GUMMEL)  Faster for low current cases.  Combined method (METHOD GUMMEL NEWTON)  Runs initial decoupled iterations and switches to coupled.  GUM.INIT parameter controls the number of initial decoupled iterations.  most robust (but slowest) method.
  • 15.  Atlas can solve both electron and hole continuity equation.  We can make this choice by using CARRIER parameters.  METHOD CARRIER = 2  Specifies, when a solution for both carriers is required.  This method is default.  METHOD CARRIER = 1 HOLE  For one carrier either electron or hole.  METHOD CARRIER = 0  For potential only.
  • 16.  The following cases require ‘METHOD NEWTON CARRIER = 2’ to be set for isothermal drift diffusion simulations  Current boundary conditions  Distributed or Lumped external elements  AC analysis  Impact ionization  Both Block or Newton are permitted for lattice heat and energy balance.