Optimal Control of Tube Drawing Processes: Theory, Algorithms, and Numerics Book PDF, ePub eBook

Join our eBook service for unlimited books & audiobooks. Get a free 7 day subscription! ↓↓↓↓↓


Book Descriptions:
This study deals with the optimal control problems of the glass tube drawing processes where the aim is to control the cross-sectional area (circular) of the tube by using the adjoint variable approach. The process of tube drawing is modeled by four coupled nonlinear partial differential equations. These equations are derived by the axisymmetric Stokes equations and the energy equation by using the approach based on asymptotic expansions with inverse aspect ratio as small parameter. Existence and uniqueness of the solutions of stationary isothermal model is also proved. By defining the cost functional, we formulated the optimal control problem. Then Lagrange functional associated with minimization problem is introduced and the first and the second order optimality conditions are derived. We also proved the existence and uniqueness of the solutions of the stationary isothermal model. We implemented the optimization algorithms based on the steepest descent, nonlinear conjugate gradient, BFGS, and Newton approaches. In the Newton method, CG iterations are introduced to solve the Newton equation. Numerical results are obtained for two different cases.

Optimal Control of Tube Drawing Processes: Theory, Algorithms, and Numerics by Azhar Iqbal Kashif Butt

From reader reviews:

James Hill:

The book Optimal Control of Tube Drawing Processes: Theory, Algorithms, and Numerics has a lot details on it. So when you make sure to read this book you can get a lot of profit. The book was published by the very famous author. The writer makes some research just before write this book. This kind of book very easy to read you may get the point easily after looking over this book.

Philip Cooper:

Don't be worry if you are afraid that this book will certainly filled the space in your house, you can have it in e-book technique, more simple and reachable. That Optimal Control of Tube Drawing Processes: Theory, Algorithms, and Numerics can give you a lot of close friends because by you checking out this one book you have factor that they don't and make you actually more like an interesting person. This kind of book can be one of one step for you to get success. This reserve offer you information that maybe your friend doesn't understand, by knowing more than various other make you to be great men and women. So , why hesitate? Let me have Optimal Control of Tube Drawing Processes: Theory, Algorithms, and Numerics.

Elois Montgomery:

As we know that book is very important thing to add our expertise for everything. By a publication we can know everything we want. A book is a group of written, printed, illustrated as well as blank sheet. Every year ended up being exactly added. This book Optimal Control of Tube Drawing Processes: Theory, Algorithms, and Numerics was filled in relation to science. Spend your time to add your knowledge about your science competence. Some people has several feel when they reading a book. If you know how big good thing about a book, you can experience enjoy to read a e-book. In the modern era like now, many ways to get book you wanted.

Michael Castillo:

Some individuals said that they feel weary when they reading a publication. They are directly felt this when they get a half parts of the book. You can choose typically the book Optimal Control of Tube Drawing Processes: Theory, Algorithms, and Numerics to make your current reading is interesting. Your skill of reading expertise is developing when you including reading. Try to choose straightforward book to make you enjoy to study it and mingle the impression about book and reading especially. It is to be first opinion for you to like to start a book and examine it. Beside that the e-book Optimal Control of Tube Drawing Processes: Theory, Algorithms, and Numerics can to be your brand new friend when you're sense alone and confuse using what must you're doing of their time.