numpy.nanmax()function is used to returns maximum value of an array or along any specific mentioned axis of the array, ignoring any Nan value.
Syntax : numpy.nanmax(arr, axis=None, out=None, keepdims = no value)
arr : Input array.
axis : Axis along which we want the max value. Otherwise, it will consider arr to be flattened(works on all the axis)axis = 0 means along the column
and axis = 1 means working along the row.
out : Different array in which we want to place the result. The array must have same dimensions as expected output.
keepdims : If this is set to True, the axes which are reduced are left in the result as dimensions with size one. With this option, the result will broadcast correctly against the original a.
Return :maximum array value(a scalar value if axis is none)or array with maximum value along specified axis.
Code #1 : Working
arr : [1, 2, 7, 0, nan] max of arr : nan nanmax of arr : 7.0
Code #2 :
arr : [[nan, 17, 12, 33, 44], [15, 6, 27, 8, 19]] max of arr, axis = None : 44.0 max of arr, axis = 0 : [15. 17. 27. 33. 44.] max of arr, axis = 1 : [44. 27.]
Code #3 :
Initial arr1 : [0 1 2 3 4] Changed arr1(having results) : [15 17 27 33 44]
- Python - Read blob object in python using wand library
- Reading Python File-Like Objects from C | Python
- Python | Convert list to Python array
- MySQL-Connector-Python module in Python
- Python | Index of Non-Zero elements in Python list
- Important differences between Python 2.x and Python 3.x with examples
- Python | PRAW - Python Reddit API Wrapper
- Python | Merge Python key values to list
- Python | Add Logging to a Python Script
- Python | Sort Python Dictionaries by Key or Value
- Python | Set 4 (Dictionary, Keywords in Python)
- Python | Add Logging to Python Libraries
- Python | Visualizing O(n) using Python
- Python if else
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.