Vinay Kariwala
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Vinay Kariwala has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Yi Cao
College of Chemical and Biological Engineering, Zhejiang University, Hangzhou, China
4 shared publications Yi Cao
School of Engineering, Cranfield University, Cranfield, Bedford MK43 0AL, U.K.
3 shared publicationsAntonius Yudi Sendjaja
School of Chemical and Biomedical Engineering, Nanyang Technological University, Singapore
2 shared publicationsJ. Fraser Forbes
Department of Chemical & Materials Engineering, University of Alberta, Edmonton, Canada T6G 2G6
2 shared publications- Antonius Yudi Sendjaja1 shared publication
- Arjun Singh
PhD student, Department of Engineering Cybernetics of Norwegian University of Science and Technology, Trondheim, Norway 7491. phone: +47-735-94482; fax: +47-735-94599
1 shared publication
Latest Publications
- 1 May 2011
- Published by Wiley in Asia-Pacific Journal of Chemical Engineering
- Vol. 6 (3) , 317-319
Selected papers from PSE ASIA 2010
- 1 May 2011
- Published by Wiley in Asia-Pacific Journal of Chemical Engineering
- Vol. 6 (3) , 317-319
Selected papers from PSE ASIA 2010
- 17 March 2011
- Published by Wiley in AIChE Journal
- Vol. 58 (3) , 842-854
Automatic differentiation‐based quadrature method of moments for solving population balance equations
The quadrature method of moments (QMOM) is a promising tool for the solution of population balance equations. QMOM requires solving differential algebraic equations (DAEs) consisting of ordinary differential equations related to the evolution of moments and nonlinear algebraic equations resulting from the quadrature approximation of moments. The available techniques for QMOM are computationally expensive and are able to solve for only a few moments due to numerical robustness deficiencies. In this article, the use of automatic differentiation (AD) is proposed for solution of DAEs arising in QMOM. In the proposed method, the variables of interest are approximated using high‐order Taylor series. The use of AD and Taylor series gives rise to algebraic equations, which can be solved sequentially to obtain high‐fidelity solution of the DAEs. Benchmark examples involving different mechanisms are used to demonstrate the superior accuracy, computational advantage, and robustness of AD‐QMOM over the existing state‐of‐the‐art technique, that is, DAE‐QMOM. © 2011 American Institute of Chemical Engineers AIChE J, 2012
- 17 March 2011
- Published by Wiley in AIChE Journal
- Vol. 58 (3) , 842-854
Automatic differentiation‐based quadrature method of moments for solving population balance equations
The quadrature method of moments (QMOM) is a promising tool for the solution of population balance equations. QMOM requires solving differential algebraic equations (DAEs) consisting of ordinary differential equations related to the evolution of moments and nonlinear algebraic equations resulting from the quadrature approximation of moments. The available techniques for QMOM are computationally expensive and are able to solve for only a few moments due to numerical robustness deficiencies. In this article, the use of automatic differentiation (AD) is proposed for solution of DAEs arising in QMOM. In the proposed method, the variables of interest are approximated using high‐order Taylor series. The use of AD and Taylor series gives rise to algebraic equations, which can be solved sequentially to obtain high‐fidelity solution of the DAEs. Benchmark examples involving different mechanisms are used to demonstrate the superior accuracy, computational advantage, and robustness of AD‐QMOM over the existing state‐of‐the‐art technique, that is, DAE‐QMOM. © 2011 American Institute of Chemical Engineers AIChE J, 2012
- 22 February 2011
- Published by American Chemical Society (ACS) in Industrial & Engineering Chemistry Research
- Vol. 50 (6) , 3415-3425
Analysis and Tuning of RTD-A Controllers
- 22 February 2011
- Published by American Chemical Society (ACS) in Industrial & Engineering Chemistry Research
- Vol. 50 (6) , 3415-3425
Analysis and Tuning of RTD-A Controllers
- 1 January 2011
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 44 (1) , 9850-9855
Local Self-optimizing Control with Input and Output Constraints
- 1 January 2011
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 44 (1) , 9850-9855
Local Self-optimizing Control with Input and Output Constraints
- 31 May 2010
- Published by Elsevier in Automatica
- Vol. 46 (5) , 932-936
Branch and bound method for multiobjective pairing selection
- 31 May 2010
- Published by Elsevier in Automatica
- Vol. 46 (5) , 932-936
Branch and bound method for multiobjective pairing selection
- 12 January 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 6 (1) , 54-61
Bidirectional Branch and Bound for Controlled Variable Selection Part III: Local Average Loss Minimization
The selection of controlled variables (CVs) from available measurements through exhaustive search is computationally forbidding for large-scale processes. We have recently proposed novel bidirectional branch and bound (B3) approaches for CV selection using the minimum singular value (MSV) rule and the local worst-case loss criterion in the framework of self-optimizing control. However, the MSV rule is approximate and worst-case scenario may not occur frequently in practice. Thus, CV selection by minimizing local average loss can be deemed as most reliable. In this work, the B3 approach is extended to CV selection based on local average loss metric. Lower bounds on local average loss and, fast pruning and branching algorithms are derived for the efficient B3 algorithm. Random matrices and binary distillation column case study are used to demonstrate the computational efficiency of the proposed method.
- 12 January 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 6 (1) , 54-61
Bidirectional Branch and Bound for Controlled Variable Selection Part III: Local Average Loss Minimization
The selection of controlled variables (CVs) from available measurements through exhaustive search is computationally forbidding for large-scale processes. We have recently proposed novel bidirectional branch and bound (B3) approaches for CV selection using the minimum singular value (MSV) rule and the local worst-case loss criterion in the framework of self-optimizing control. However, the MSV rule is approximate and worst-case scenario may not occur frequently in practice. Thus, CV selection by minimizing local average loss can be deemed as most reliable. In this work, the B3 approach is extended to CV selection based on local average loss metric. Lower bounds on local average loss and, fast pruning and branching algorithms are derived for the efficient B3 algorithm. Random matrices and binary distillation column case study are used to demonstrate the computational efficiency of the proposed method.
- 1 January 2010
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 43 (5) , 397-402
Automatic Differentiation based QMOM for Population Balance Equations
- 1 January 2010
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 43 (5) , 397-402
Automatic Differentiation based QMOM for Population Balance Equations
- 28 July 2009
- Published by Wiley in The Canadian Journal of Chemical Engineering
- Vol. 87 (4) , 632-636
Confirmation of control valve stiction in interacting systems
- 28 July 2009
- Published by Wiley in The Canadian Journal of Chemical Engineering
- Vol. 87 (4) , 632-636
Confirmation of control valve stiction in interacting systems
- 30 June 2009
- Published by Elsevier in Journal of Process Control
- Vol. 19 (6) , 1061-1065
Achievable PID performance using sums of squares programming
- 30 June 2009
- Published by Elsevier in Journal of Process Control
- Vol. 19 (6) , 1061-1065
Achievable PID performance using sums of squares programming
- 1 January 2009
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 42 (11) , 625-630
Bidirectional Branch and Bound Method for Selecting Controlled Variables
- 1 January 2009
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 42 (11) , 625-630
Bidirectional Branch and Bound Method for Selecting Controlled Variables